#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
const int mod = (int)1e9 + 7;
const int N = 6e4 + 10;
const long long inf = -1e9;
const int maxm = 53;
vector<vector<char>> matrix(maxm, vector<char>(maxm));
vector<vector<int>> vt(maxm, vector<int>(maxm));
struct event {
  int x, y, size;
};
int dx[] = {0, 0, 1, -1};
int dy[] = {-1, 1, 0, 0};
struct myComp {
  constexpr bool operator()(pair<int, int> const& a,
                            pair<int, int> const& b) const noexcept {
    return a.first < b.first;
  }
};
vector<int> g[N];
vector<char> p = {'a', 'e', 'i', 'o', 'u', 'y'};
bool is_char(char c) {
  for (auto it : p)
    if (it == c) return true;
  return false;
}
bool ok(char c) {
  if (c == 'o' || c == 'e') return true;
  return false;
}
void solve() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  string res;
  for (int i = 0; i < n; i++) {
    if (is_char(s[i])) {
      int k = i;
      while (k < n && s[k] == s[i]) k++;
      if (k - i == 2 && ok(s[i])) res += s[i];
      i = k - 1;
    }
    res += s[i];
  }
  cout << res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
