#include <bits/stdc++.h>
using namespace std;
int dir8[8][2] = {{1, 2},  {2, 1},   {-1, 2},  {2, -1},
                  {-2, 1}, {-2, -1}, {-1, -2}, {1, -2}};
int dir4[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
const int INF = 0x3f3f3f3fLL;
const long long LLF = 0x3f3f3f3f3f3f3f3fLL;
const int MAXn = 2e5 + 15;
const int mod = 1e9 + 7;
char v[7] = {'e', 'o', 'a', 'i', 'y', 'u'}, s[MAXn], s1[MAXn];
int p = 0;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, ans = 1, j;
  cin >> n >> s;
  for (int i = 0; i < n; i++) {
    if (s[i] == s[i + 1]) {
      ans++;
    } else {
      for (j = 0; j < 6; j++) {
        if (s[i] == v[j]) break;
      }
      if (j <= 1) {
        if (ans > 2)
          s1[p++] = s[i];
        else
          while (ans--) {
            s1[p++] = s[i];
          }
      } else if (j >= 2 && j < 6) {
        s1[p++] = s[i];
      } else if (j >= 6)
        while (ans--) {
          s1[p++] = s[i];
        }
      ans = 1;
    }
  }
  cout << s1 << endl;
  return 0;
}
