#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = (int)1e9 + 7;
const int N = (int)1e6 + 7;
int n;
char s[N];
bool check(char c) {
  char t[] = "aeiouy";
  for (int i = 0; t[i]; ++i)
    if (c == t[i]) return true;
  return false;
}
void Init() { scanf("%s", s); }
int Solve() {
  int len = strlen(s);
  vector<char> ans;
  for (int pl = 0, pr = 0; pl < n; pl = pr) {
    while (pr < len && s[pr] == s[pl]) pr++;
    int cnt = pr - pl;
    if (check(s[pl])) {
      if (s[pl] != 'e' && s[pl] != 'o')
        cnt = 1;
      else
        cnt = cnt > 2 ? 1 : cnt;
    }
    for (int i = (0); i < (cnt); ++i) ans.push_back(s[pl]);
  }
  for (auto x : ans) printf("%c", x);
  return puts("");
}
int main() {
  while (~scanf("%d", &n)) {
    Init();
    Solve();
  }
  return 0;
}
