#include <bits/stdc++.h>
const long long SZ = 1e5 + 7;
const long long inf = 1e18;
const long long MOD = 1e9 + 7;
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void krdiyasuru() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  long long i = 0;
  while (i < n) {
    if (s[i] != 'a' && s[i] != 'e' && s[i] != 'o' && s[i] != 'u' &&
        s[i] != 'i' && s[i] != 'y') {
      cout << s[i];
      i++;
      continue;
    }
    long long j = i;
    while (j < n && s[i] == s[j]) {
      j++;
    }
    if (j - i == 2 && (s[i] == 'o' || s[i] == 'e')) {
      cout << s[i];
      cout << s[i + 1];
    } else {
      cout << s[i];
    }
    i = j;
  }
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  { krdiyasuru(); }
  return 0;
}
