#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  string s, moon, tn, mn, xn;
  cin >> s;
  int len = s.size();
  for (int i = 0; i < len; i++) {
    if (s[i] == 'a' && s[i + 1] == 'a' || s[i] == 'a' && s[i + 1] == 'e' ||
        s[i] == 'a' && s[i + 1] == 'i' || s[i] == 'a' && s[i + 1] == 'o' ||
        s[i] == 'a' && s[i + 1] == 'u' || s[i] == 'a' && s[i + 1] == 'y' ||
        s[i] == 'e' && s[i + 1] == 'a' || s[i] == 'e' && s[i + 1] == 'e' ||
        s[i] == 'e' && s[i + 1] == 'i' || s[i] == 'e' && s[i + 1] == 'o' ||
        s[i] == 'e' && s[i + 1] == 'u' || s[i] == 'e' && s[i + 1] == 'y' ||
        s[i] == 'i' && s[i + 1] == 'a' || s[i] == 'i' && s[i + 1] == 'e' ||
        s[i] == 'i' && s[i + 1] == 'i' || s[i] == 'i' && s[i + 1] == 'o' ||
        s[i] == 'i' && s[i + 1] == 'u' || s[i] == 'i' && s[i + 1] == 'y' ||
        s[i] == 'o' && s[i + 1] == 'a' || s[i] == 'o' && s[i + 1] == 'e' ||
        s[i] == 'o' && s[i + 1] == 'i' || s[i] == 'o' && s[i + 1] == 'o' ||
        s[i] == 'o' && s[i + 1] == 'u' || s[i] == 'o' && s[i + 1] == 'y' ||
        s[i] == 'u' && s[i + 1] == 'a' || s[i] == 'u' && s[i + 1] == 'e' ||
        s[i] == 'u' && s[i + 1] == 'i' || s[i] == 'u' && s[i + 1] == 'o' ||
        s[i] == 'u' && s[i + 1] == 'u' || s[i] == 'u' && s[i + 1] == 'y' ||
        s[i] == 'y' && s[i + 1] == 'a' || s[i] == 'y' && s[i + 1] == 'e' ||
        s[i] == 'y' && s[i + 1] == 'i' || s[i] == 'y' && s[i + 1] == 'o' ||
        s[i] == 'y' && s[i + 1] == 'u' || s[i] == 'y' && s[i + 1] == 'y') {
      s[i + 1] = '#';
    }
  }
  for (int i = 0; i < len; i++) {
    if (s[i] != '#') {
      moon += s[i];
    }
  }
  for (int i = 0; i < moon.size(); i++) {
    if (moon[i] == 'a' && moon[i + 1] == 'a' ||
        moon[i] == 'a' && moon[i + 1] == 'e' ||
        moon[i] == 'a' && moon[i + 1] == 'i' ||
        moon[i] == 'a' && moon[i + 1] == 'o' ||
        moon[i] == 'a' && moon[i + 1] == 'u' ||
        moon[i] == 'a' && moon[i + 1] == 'y' ||
        moon[i] == 'e' && moon[i + 1] == 'a' ||
        moon[i] == 'e' && moon[i + 1] == 'e' ||
        moon[i] == 'e' && moon[i + 1] == 'i' ||
        moon[i] == 'e' && moon[i + 1] == 'o' ||
        moon[i] == 'e' && moon[i + 1] == 'u' ||
        moon[i] == 'e' && moon[i + 1] == 'y' ||
        moon[i] == 'i' && moon[i + 1] == 'a' ||
        moon[i] == 'i' && moon[i + 1] == 'e' ||
        moon[i] == 'i' && moon[i + 1] == 'i' ||
        moon[i] == 'i' && moon[i + 1] == 'o' ||
        moon[i] == 'i' && moon[i + 1] == 'u' ||
        moon[i] == 'i' && moon[i + 1] == 'y' ||
        moon[i] == 'o' && moon[i + 1] == 'a' ||
        moon[i] == 'o' && moon[i + 1] == 'e' ||
        moon[i] == 'o' && moon[i + 1] == 'i' ||
        moon[i] == 'o' && moon[i + 1] == 'o' ||
        moon[i] == 'o' && moon[i + 1] == 'u' ||
        moon[i] == 'o' && moon[i + 1] == 'y' ||
        moon[i] == 'u' && moon[i + 1] == 'a' ||
        moon[i] == 'u' && moon[i + 1] == 'e' ||
        moon[i] == 'u' && moon[i + 1] == 'i' ||
        moon[i] == 'u' && moon[i + 1] == 'o' ||
        moon[i] == 'u' && moon[i + 1] == 'u' ||
        moon[i] == 'u' && moon[i + 1] == 'y' ||
        moon[i] == 'y' && moon[i + 1] == 'a' ||
        moon[i] == 'y' && moon[i + 1] == 'e' ||
        moon[i] == 'y' && moon[i + 1] == 'i' ||
        moon[i] == 'y' && moon[i + 1] == 'o' ||
        moon[i] == 'y' && moon[i + 1] == 'u' ||
        moon[i] == 'y' && moon[i + 1] == 'y') {
      moon[i + 1] = '#';
    }
  }
  for (int i = 0; i < moon.size(); i++) {
    if (moon[i] != '#') tn += moon[i];
  }
  for (int i = 0; i < tn.size(); i++) {
    if (tn[i] != '#') mn += tn[i];
  }
  for (int i = 0; i < mn.size(); i++) {
    if (mn[i] == mn[i + 1] && mn[i] == 'a' && mn[i + 1] == 'a' ||
        mn[i] == 'a' && mn[i + 1] == 'e' || mn[i] == 'a' && mn[i + 1] == 'i' ||
        mn[i] == 'a' && mn[i + 1] == 'o' || mn[i] == 'a' && mn[i + 1] == 'u' ||
        mn[i] == 'a' && mn[i + 1] == 'y' || mn[i] == 'e' && mn[i + 1] == 'a' ||
        mn[i] == 'e' && mn[i + 1] == 'e' || mn[i] == 'e' && mn[i + 1] == 'i' ||
        mn[i] == 'e' && mn[i + 1] == 'o' || mn[i] == 'e' && mn[i + 1] == 'u' ||
        mn[i] == 'e' && mn[i + 1] == 'y' || mn[i] == 'i' && mn[i + 1] == 'a' ||
        mn[i] == 'i' && mn[i + 1] == 'e' || mn[i] == 'i' && mn[i + 1] == 'i' ||
        mn[i] == 'i' && mn[i + 1] == 'o' || mn[i] == 'i' && mn[i + 1] == 'u' ||
        mn[i] == 'i' && mn[i + 1] == 'y' || mn[i] == 'o' && mn[i + 1] == 'a' ||
        mn[i] == 'o' && mn[i + 1] == 'e' || mn[i] == 'o' && mn[i + 1] == 'i' ||
        mn[i] == 'o' && mn[i + 1] == 'o' || mn[i] == 'o' && mn[i + 1] == 'u' ||
        mn[i] == 'o' && mn[i + 1] == 'y' || mn[i] == 'u' && mn[i + 1] == 'a' ||
        mn[i] == 'u' && mn[i + 1] == 'e' || mn[i] == 'u' && mn[i + 1] == 'i' ||
        mn[i] == 'u' && mn[i + 1] == 'o' || mn[i] == 'u' && mn[i + 1] == 'u' ||
        mn[i] == 'u' && mn[i + 1] == 'y' || mn[i] == 'y' && mn[i + 1] == 'a' ||
        mn[i] == 'y' && mn[i + 1] == 'e' || mn[i] == 'y' && mn[i + 1] == 'i' ||
        mn[i] == 'y' && mn[i + 1] == 'o' || mn[i] == 'y' && mn[i + 1] == 'u' ||
        mn[i] == 'y' && mn[i + 1] == 'y') {
      mn[i + 1] = '#';
    }
  }
  for (int i = 0; i < mn.size(); i++) {
    if (mn[i] != '#') xn += mn[i];
  }
  for (int i = 0; i < xn.size(); i++) {
    if (xn[i] == 'o' && xn[i + 1] == 'o' || xn[i] == 'i' && xn[i + 1] == 'i' ||
        xn[i] == 'y' && xn[i + 1] == 'i' || xn[i] == 'a' && xn[i + 1] == 'a') {
      xn[i + 1] = '#';
    }
  }
  for (int i = 0; i < xn.size(); i++) {
    if (xn[i] != '#') {
      cout << xn[i];
    }
  }
}

### Prompt

Construct a CPP code solution to the problem outlined:

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.

Examples

Input

5
weird


Output

werd


Input

4
word


Output

word


Input

5
aaeaa


Output

a

Note

Explanations of the examples:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  string s, moon, tn, mn, xn;
  cin >> s;
  int len = s.size();
  for (int i = 0; i < len; i++) {
    if (s[i] == 'a' && s[i + 1] == 'a' || s[i] == 'a' && s[i + 1] == 'e' ||
        s[i] == 'a' && s[i + 1] == 'i' || s[i] == 'a' && s[i + 1] == 'o' ||
        s[i] == 'a' && s[i + 1] == 'u' || s[i] == 'a' && s[i + 1] == 'y' ||
        s[i] == 'e' && s[i + 1] == 'a' || s[i] == 'e' && s[i + 1] == 'e' ||
        s[i] == 'e' && s[i + 1] == 'i' || s[i] == 'e' && s[i + 1] == 'o' ||
        s[i] == 'e' && s[i + 1] == 'u' || s[i] == 'e' && s[i + 1] == 'y' ||
        s[i] == 'i' && s[i + 1] == 'a' || s[i] == 'i' && s[i + 1] == 'e' ||
        s[i] == 'i' && s[i + 1] == 'i' || s[i] == 'i' && s[i + 1] == 'o' ||
        s[i] == 'i' && s[i + 1] == 'u' || s[i] == 'i' && s[i + 1] == 'y' ||
        s[i] == 'o' && s[i + 1] == 'a' || s[i] == 'o' && s[i + 1] == 'e' ||
        s[i] == 'o' && s[i + 1] == 'i' || s[i] == 'o' && s[i + 1] == 'o' ||
        s[i] == 'o' && s[i + 1] == 'u' || s[i] == 'o' && s[i + 1] == 'y' ||
        s[i] == 'u' && s[i + 1] == 'a' || s[i] == 'u' && s[i + 1] == 'e' ||
        s[i] == 'u' && s[i + 1] == 'i' || s[i] == 'u' && s[i + 1] == 'o' ||
        s[i] == 'u' && s[i + 1] == 'u' || s[i] == 'u' && s[i + 1] == 'y' ||
        s[i] == 'y' && s[i + 1] == 'a' || s[i] == 'y' && s[i + 1] == 'e' ||
        s[i] == 'y' && s[i + 1] == 'i' || s[i] == 'y' && s[i + 1] == 'o' ||
        s[i] == 'y' && s[i + 1] == 'u' || s[i] == 'y' && s[i + 1] == 'y') {
      s[i + 1] = '#';
    }
  }
  for (int i = 0; i < len; i++) {
    if (s[i] != '#') {
      moon += s[i];
    }
  }
  for (int i = 0; i < moon.size(); i++) {
    if (moon[i] == 'a' && moon[i + 1] == 'a' ||
        moon[i] == 'a' && moon[i + 1] == 'e' ||
        moon[i] == 'a' && moon[i + 1] == 'i' ||
        moon[i] == 'a' && moon[i + 1] == 'o' ||
        moon[i] == 'a' && moon[i + 1] == 'u' ||
        moon[i] == 'a' && moon[i + 1] == 'y' ||
        moon[i] == 'e' && moon[i + 1] == 'a' ||
        moon[i] == 'e' && moon[i + 1] == 'e' ||
        moon[i] == 'e' && moon[i + 1] == 'i' ||
        moon[i] == 'e' && moon[i + 1] == 'o' ||
        moon[i] == 'e' && moon[i + 1] == 'u' ||
        moon[i] == 'e' && moon[i + 1] == 'y' ||
        moon[i] == 'i' && moon[i + 1] == 'a' ||
        moon[i] == 'i' && moon[i + 1] == 'e' ||
        moon[i] == 'i' && moon[i + 1] == 'i' ||
        moon[i] == 'i' && moon[i + 1] == 'o' ||
        moon[i] == 'i' && moon[i + 1] == 'u' ||
        moon[i] == 'i' && moon[i + 1] == 'y' ||
        moon[i] == 'o' && moon[i + 1] == 'a' ||
        moon[i] == 'o' && moon[i + 1] == 'e' ||
        moon[i] == 'o' && moon[i + 1] == 'i' ||
        moon[i] == 'o' && moon[i + 1] == 'o' ||
        moon[i] == 'o' && moon[i + 1] == 'u' ||
        moon[i] == 'o' && moon[i + 1] == 'y' ||
        moon[i] == 'u' && moon[i + 1] == 'a' ||
        moon[i] == 'u' && moon[i + 1] == 'e' ||
        moon[i] == 'u' && moon[i + 1] == 'i' ||
        moon[i] == 'u' && moon[i + 1] == 'o' ||
        moon[i] == 'u' && moon[i + 1] == 'u' ||
        moon[i] == 'u' && moon[i + 1] == 'y' ||
        moon[i] == 'y' && moon[i + 1] == 'a' ||
        moon[i] == 'y' && moon[i + 1] == 'e' ||
        moon[i] == 'y' && moon[i + 1] == 'i' ||
        moon[i] == 'y' && moon[i + 1] == 'o' ||
        moon[i] == 'y' && moon[i + 1] == 'u' ||
        moon[i] == 'y' && moon[i + 1] == 'y') {
      moon[i + 1] = '#';
    }
  }
  for (int i = 0; i < moon.size(); i++) {
    if (moon[i] != '#') tn += moon[i];
  }
  for (int i = 0; i < tn.size(); i++) {
    if (tn[i] != '#') mn += tn[i];
  }
  for (int i = 0; i < mn.size(); i++) {
    if (mn[i] == mn[i + 1] && mn[i] == 'a' && mn[i + 1] == 'a' ||
        mn[i] == 'a' && mn[i + 1] == 'e' || mn[i] == 'a' && mn[i + 1] == 'i' ||
        mn[i] == 'a' && mn[i + 1] == 'o' || mn[i] == 'a' && mn[i + 1] == 'u' ||
        mn[i] == 'a' && mn[i + 1] == 'y' || mn[i] == 'e' && mn[i + 1] == 'a' ||
        mn[i] == 'e' && mn[i + 1] == 'e' || mn[i] == 'e' && mn[i + 1] == 'i' ||
        mn[i] == 'e' && mn[i + 1] == 'o' || mn[i] == 'e' && mn[i + 1] == 'u' ||
        mn[i] == 'e' && mn[i + 1] == 'y' || mn[i] == 'i' && mn[i + 1] == 'a' ||
        mn[i] == 'i' && mn[i + 1] == 'e' || mn[i] == 'i' && mn[i + 1] == 'i' ||
        mn[i] == 'i' && mn[i + 1] == 'o' || mn[i] == 'i' && mn[i + 1] == 'u' ||
        mn[i] == 'i' && mn[i + 1] == 'y' || mn[i] == 'o' && mn[i + 1] == 'a' ||
        mn[i] == 'o' && mn[i + 1] == 'e' || mn[i] == 'o' && mn[i + 1] == 'i' ||
        mn[i] == 'o' && mn[i + 1] == 'o' || mn[i] == 'o' && mn[i + 1] == 'u' ||
        mn[i] == 'o' && mn[i + 1] == 'y' || mn[i] == 'u' && mn[i + 1] == 'a' ||
        mn[i] == 'u' && mn[i + 1] == 'e' || mn[i] == 'u' && mn[i + 1] == 'i' ||
        mn[i] == 'u' && mn[i + 1] == 'o' || mn[i] == 'u' && mn[i + 1] == 'u' ||
        mn[i] == 'u' && mn[i + 1] == 'y' || mn[i] == 'y' && mn[i + 1] == 'a' ||
        mn[i] == 'y' && mn[i + 1] == 'e' || mn[i] == 'y' && mn[i + 1] == 'i' ||
        mn[i] == 'y' && mn[i + 1] == 'o' || mn[i] == 'y' && mn[i + 1] == 'u' ||
        mn[i] == 'y' && mn[i + 1] == 'y') {
      mn[i + 1] = '#';
    }
  }
  for (int i = 0; i < mn.size(); i++) {
    if (mn[i] != '#') xn += mn[i];
  }
  for (int i = 0; i < xn.size(); i++) {
    if (xn[i] == 'o' && xn[i + 1] == 'o' || xn[i] == 'i' && xn[i + 1] == 'i' ||
        xn[i] == 'y' && xn[i + 1] == 'i' || xn[i] == 'a' && xn[i + 1] == 'a') {
      xn[i + 1] = '#';
    }
  }
  for (int i = 0; i < xn.size(); i++) {
    if (xn[i] != '#') {
      cout << xn[i];
    }
  }
}

```