{"raw_statement":[{"iden":"statement","content":"Stepan likes to repeat vowel letters when he writes words. For example, instead of the word \"_pobeda_\" he can write \"_pobeeeedaaaaa_\".\n\nSergey does not like such behavior, so he wants to write a program to format the words written by Stepan. This program must combine all consecutive equal vowels to a single vowel. The vowel letters are \"_a_\", \"_e_\", \"_i_\", \"_o_\", \"_u_\" and \"_y_\".\n\nThere are exceptions: if letters \"_e_\" or \"_o_\" repeat in a row exactly 2 times, like in words \"_feet_\" and \"_foot_\", the program must skip them and do not transform in one vowel. For example, the word \"_iiiimpleeemeentatiioon_\" must be converted to the word \"_implemeentatioon_\".\n\nSergey is very busy and asks you to help him and write the required program."},{"iden":"input","content":"The first line contains the integer _n_ (1 ≤ _n_ ≤ 100 000) — the number of letters in the word written by Stepan.\n\nThe second line contains the string _s_ which has length that equals to _n_ and contains only lowercase English letters — the word written by Stepan."},{"iden":"output","content":"Print the single string — the word written by Stepan converted according to the rules described in the statement."},{"iden":"examples","content":"Input\n\n13\npobeeeedaaaaa\n\nOutput\n\npobeda\n\nInput\n\n22\niiiimpleeemeentatiioon\n\nOutput\n\nimplemeentatioon\n\nInput\n\n18\naeiouyaaeeiioouuyy\n\nOutput\n\naeiouyaeeioouy\n\nInput\n\n24\naaaoooiiiuuuyyyeeeggghhh\n\nOutput\n\naoiuyeggghhh"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":null,"simple_statement":null,"has_page_source":false}