CF938A.Word Correction

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.

维克多试图编写一个属于自己的文本编辑器，其中包含单词校正功能。然而，单词校正的规则非常奇怪。

维克多认为，如果一个单词中包含两个连续的元音字母，那么这个词就显得有些怪异，需要被替换。因此，该单词校正器的工作方式如下：只要单词中还存在两个连续的元音字母，它就会删除单词中紧前面还有一个元音字母的那个元音字母（即删除某个元音字母，使得该元音字母前紧邻的字符也是一个元音字母）。如果单词中不再存在两个连续的元音字母，则认为该单词已正确。

现给你一个单词 $s$。你能预测它经过校正后会变成什么样子吗？

在本题中，字母 a、e、i、o、u 和 y 被视为元音字母。

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.

第一行包含一个整数 $n$（$1 \leq n \leq 100$）——校正前单词 $s$ 的字母个数。

第二行包含一个由恰好 $n$ 个小写拉丁字母组成的字符串 $s$ —— 校正前的单词。

Output the word s after the correction.

输出修正后的单词 s。

Explanations of the examples:

1. There is only one replace: weird werd;
2. No replace needed since there are no two consecutive vowels;
3. aaeaa aeaa aaa aa a.

示例解释：

1. 只需一次替换：weird werd；
2. 无需替换，因为原字符串中不存在两个连续的元音字母；
3. aaeaa aeaa aaa aa a。