CF938A.Word Correction

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

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 the word $s$ after the correction.

输入输出样例

输入#1
```
5
weird
```
输出#1
```
werd
```
输入#2
```
4
word
```
输出#2
```
word
```
输入#3
```
5
aaeaa
```
输出#3
```
a
```

说明/提示

Explanations of the examples:

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

首页