#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 100 + 7, maxd = 1e5 + 7;
const int mod = 1e9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
int n;
char s[maxn];
int vis[maxn];
int main() {
cin >> n;
scanf("%s", s);
int len = strlen(s), f = 0;
memset(vis, 0, sizeof 0);
for(int i = 0; i < len; ++i) {
if(f == 1) {
if(s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u' || s[i] == 'y') {
vis[i] = 1;
}
else f = 0;
}
else {
if(s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u' || s[i] == 'y') {
f = 1;
}
}
}
for(int i = 0; i < len; ++i) {
if(vis[i] == 0) cout << s[i];
}
return 0;
}