Word Correction

1000ms

262144K

Description:

Victor tries to write his own text editor, with word correction included. However, the rules of word correction are really strange.

Victor thinks that if a word contains two consecutive vowels, then it's kinda weird and it needs to be replaced. So the word corrector works in such a way: as long as there are two consecutive vowels in the word, it deletes the first vowel in a word such that there is another vowel right before it. If there are no two consecutive vowels in the word, it is considered to be correct.

You are given a word s. Can you predict what will it become after correction?

In this problem letters a, e, i, o, u and y are considered to be vowels.

Input:

The first line contains one integer n (1 ≤ n ≤ 100) — the number of letters in word s before the correction.

The second line contains a string s consisting of exactly n lowercase Latin letters — the word before the correction.

Output:

Output the word s after the correction.

Sample Input:

5
weird

Sample Output:

werd

Sample Input:

4
word

Sample Output:

word

Sample Input:

5
aaeaa

Sample Output:

Note:

Explanations of the examples:

There is only one replace: weird $\text{[math]}$ werd;
No replace needed since there are no two consecutive vowels;
aaeaa $\text{[math]}$ aeaa $\text{[math]}$ aaa $\text{[math]}$ aa $\text{[math]}$ a.

Informação

Provedor Codeforces

Código CF938A