#include <bits/stdc++.h>
using namespace std;
template <typename X>
inline bool minimize(X& p, X q) {
  if (p <= q) return 0;
  p = q;
  return 1;
}
template <typename X>
inline bool maximize(X& p, X q) {
  if (p >= q) return 0;
  p = q;
  return 1;
}
const long long inf = 1000000000000;
struct node {
  int x, y;
  bool operator<(const node& oth) const { return x < oth.x; }
} a[105], b[105];
int d1[1005], d2[1005], c[1005];
vector<int> aa, bb;
const int mod = 1000000007;
char s[105];
int n;
int main() {
  scanf("%d%s", &n, s);
  int x = 0;
  for (int i = 0; i <= n - 1; i++) {
    if (s[i] == 'a' || s[i] == 'e' || s[i] == 'o' || s[i] == 'i' ||
        s[i] == 'u' || s[i] == 'y') {
      if (x == 0) printf("%c", s[i]);
      x++;
    } else {
      x = 0;
      printf("%c", s[i]);
    }
  }
}
