#include <bits/stdc++.h>
const int N = 1e6 + 5;
int p[1000000], w[1000000];
int find(int x) {
  if (p[x] == x)
    return x;
  else {
    p[x] = find(p[x]);
    return p[x];
  }
}
void join(int a, int b) {
  if ((a = find(a)) == (b = find(b))) return;
  if (w[a] < w[b]) {
    int temp = a;
    a = b;
    b = temp;
  }
  w[a] += w[b];
  p[b] = a;
}
int vowel(char c) {
  if (c == 'o' || c == 'e') return 2;
  if (c == 'a' || c == 'u' || c == 'y' || c == 'i') return 1;
  return 0;
}
char s[1000000];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    p[i] = i;
    w[i] = 1;
  }
  scanf("%s", s);
  for (int i = 1; i < n; i++) {
    if (s[i] == s[i - 1]) join(i, i - 1);
  }
  for (int i = 0; i < n; i++) {
    if (find(i) == i) {
      int k = vowel(s[i]);
      if (k) {
        if (k == 2 && w[i] == 2) {
          printf("%c%c", s[i], s[i]);
        } else
          printf("%c", s[i]);
      } else {
        for (int j = 0; j < w[i]; j++) {
          printf("%c", s[i]);
        }
      }
    }
  }
  printf("\n");
  return 0;
}
