#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  string s, res;
  string ex = "aoeuyi";
  cin >> n >> s;
  for (int i = 0; i < n; i++) {
    size_t pos = ex.find(s[i]);
    if (pos != string::npos) {
      int cnt = 0, p = i;
      while (s[i] == s[p++]) cnt++;
      if ((cnt == 2) && (s[i] == 'e' || s[i] == 'o')) {
        res += s.substr(i, cnt);
        i += cnt - 1;
      } else {
        res += s[i];
        i += cnt - 1;
      }
    } else {
      res += s[i];
    }
  }
  cout << res << endl;
}
int main() {
  solve();
  return 0;
}
