#include <bits/stdc++.h>
using namespace std;
void debug(string S = "hello ! debug") {
  cout << S << endl;
  return;
}
template <class T>
void printVector(vector<T> &V) {
  cout << endl;
  for (int i = 0; i < V.size(); ++i) {
    cout << V[i] << " ";
  }
  cout << endl;
  return;
}
long long int sizeOfSt(long long int N) {
  long long int x = (long long int)(ceil(log2(N)));
  long long int max_size = 2 * (long long int)pow(2, x) - 1;
  return max_size;
}
template <class T>
T maximumFromVector(vector<T> &V) {
  T ans = V[0];
  for (int i = 1; i < V.size(); ++i) {
    ans = max(ans, V[i]);
  }
  return ans;
}
template <class T>
T minimumFromVector(vector<T> &V) {
  T ans = V[0];
  for (int i = 1; i < V.size(); ++i) {
    ans = min(ans, V[i]);
  }
  return ans;
}
template <class T>
T vectorSum(vector<T> &V) {
  T sum = 0;
  for (long long int i = 0; i < V.size(); ++i) {
    sum += V[i];
  }
  return sum;
}
bool isVowel(char ch) {
  return (ch == 'a') || (ch == 'e') || (ch == 'i') || (ch == 'o') ||
         ch == ('u') || (ch == 'y');
}
string process(string &s) {
  string ans;
  ans.push_back(s[0]);
  for (long long int i = 1; i < s.length(); ++i) {
    if (isVowel(s[i]) && isVowel(s[i - 1])) {
      ans.append(s.substr(i + 1));
      break;
    }
    ans.push_back(s[i]);
  }
  return ans;
}
int main() {
  long long int n;
  scanf("%lld", &n);
  string S;
  cin >> S;
  bool done = false;
  while (!done) {
    string ss = process(S);
    if (S == ss) {
      S = ss;
      done = true;
    } else {
      S = ss;
    }
  }
  cout << S;
  return 0;
}
