Victor tries to write his own text editor, with word correction included. However, the rules of word correction are really strange.

Victor thinks that if a word contains two consecutive vowels, then it's kinda weird and it needs to be replaced. So the word corrector works in such a way: as long as there are two consecutive vowels in the word, it deletes the first vowel in a word such that there is another vowel right before it. If there are no two consecutive vowels in the word, it is considered to be correct.

You are given a word s. Can you predict what will it become after correction?

In this problem letters a, e, i, o, u and y are considered to be vowels.


-----Input-----

The first line contains one integer n (1 ≤ n ≤ 100) — the number of letters in word s before the correction.

The second line contains a string s consisting of exactly n lowercase Latin letters — the word before the correction.


-----Output-----

Output the word s after the correction.


-----Examples-----
Input
5
weird

Output
werd

Input
4
word

Output
word

Input
5
aaeaa

Output
a



-----Note-----

Explanations of the examples:  There is only one replace: weird $\rightarrow$ werd; No replace needed since there are no two consecutive vowels; aaeaa $\rightarrow$ aeaa $\rightarrow$ aaa $\rightarrow$ aa $\rightarrow$ a.

Difficulty: interview

Starter code:

Solutions:
n = int(input())
s = input()
t = []
vowels = 'aeiouy'
for c in s:
    if t and t[-1] in vowels and c in vowels:
        continue
    else:
        t.append(c)
print(''.join(t))


n=int(input())
s=list(input())
el=0
while el+1<len(s):
    if s[el] in 'aeiouy' and s[el+1] in "aeiouy":
        del s[el+1]
    else:
        el+=1
print(''.join(s))

n = input()
s = input()

res = ''
v = False
for c in s:
    if c in 'aeiouy' and not v:
        v = True
        res += c
    if c not in 'aeiouy':
        if v:
            v = False
        res += c

print(res)


n = int(input())
s = input()
i = 0
while i < len(s):
	if i < len(s) - 1 and s[i + 1] in 'aeyuio' and s[i] in 'aeyuio':
		s = s[:i + 1] + s[i + 2:]
		i -= 1
	i += 1
print(s)

n = int(input())
s = input()
vowel = "aeiouy"
first = 0
for x in s:
	if x in vowel and not first:
		first = 1
		print(x, end="")
	elif x not in vowel:
		first = 0
		print(x, end="")
print()


input()
s = input()
g = {'a','e','o','i','u','y'}
done = False
while not done:
    done = True
    for i in range(1, len(s)):
        if s[i] in g and s[i-1] in g:
            done = False
            s = s[:i] + s[i+1:]
            break
print(s)

n = int(input())
s = list(input())
glas = list('aoiyue')
f = 1
while f:
    f = 0
    for i in range(1, len(s)):
        if s[i] in glas and s[i - 1] in glas:
            f = 1
            s = s[:i] + s[i + 1:]
            break
print(''.join(s))

d = {'a', 'e', 'i', 'o', 'u', 'y'}

n = int(input())
s = list(input())

found = -1
while 1:
    found = -1
    for i in range(len(s) - 1):
        if s[i] in d and s[i + 1] in d:
            found = i + 1
            break
    if (found == -1):
        break
    s.pop(found)
print(*s, sep="")

n = int(input())
check = ['a', 'e', 'i', 'o', 'u', 'y']
a = input()
i = 1
while (i < len(a)):
    if a[i] in check and a[i - 1] in check:
        a = a[:i] + a[i + 1:]
    else:
        i += 1
print(a)

n = int(input())
s = input()
gl = "aeiouy"
t=True
for i in range(n):
    if s[i] not in gl:
        print(s[i],end="")
        t = True
    elif t:
        print(s[i],end="")
        t = False

input()
s = list(input())

def isGlasnaya(char):
    return char in ['a', 'e', 'i', 'o', 'u', 'y']

i = 0
while i + 1 < len(s):
    if isGlasnaya(s[i]) and isGlasnaya(s[i + 1]):
        del s[i + 1]
        i = 0
    else:
        i += 1
print(''.join(s))


v = 'aiouey'
n = int(input())
s= input()
o =s[0]
for i in range(1,n):
    if (s[i] in v):
        if s[i-1] not in v:o+=s[i]
    else:o+=s[i]
print(o)


n = input()
s = input()
bad = "aeiouy"
while True:
    ok = True
    for i in range(1, len(s)):
        if (s[i] in bad) and (s[i-1] in bad):
            s = s[:i] + s[i+1:]
            ok = False
            break
    if(ok):
        print(s)
        break
            


b = "aeiouy"
n = int(input())
s = input()
a = [0] * len(s)
for i in range(1, len(s)):
    if s[i - 1] in b and s[i] in b:
        a[i] = 1
for i in  range(len(s)):
    if not a[i]:
        print(s[i], end="")
        

b = input()
a = input()
c = []
g = 'aeiouy'
c.append(a[0])
for i in range(len(a)-1):
    if a[i] in g and a[i+1] in g:
        pass
    else:
        c.append(a[i+1])



print(''.join(c))



n = input()
s = input()
v = 'euoaiy'
i = 1
while True:
    if i >= len(s):
        break
    if s[i] in v and s[i - 1] in v:
        s = s[:i] + s[i + 1:]
    else:
        i += 1

print(s)


n = int(input())
s = list(input())
gl = ['a', 'e', 'i', 'o', 'u', 'y']
x = -1
uber = []
k = 0
for i in range(n - 1):
    if s[i] in gl and s[i + 1] in gl:
        uber.append(i + 1)
for i in uber:
    s.pop(i - k)
    k += 1
print(''.join(s))

v = 'aeiouy'
n = input()
a = input()
i = 0
try:
    while i < len(a):
        while a[i] in v and a[i+1] in v:
            a = a[:i+1] + a[i+2:]
        i += 1
except:
    pass
print(a)


import sys

def is_vowel(c):
    return c in set("aeiouy")

def main():
    _ = input()
    s = input()
    
    for _ in range(len(s)):
        for i in range(len(s) - 1):
            if is_vowel(s[i]) and is_vowel(s[i + 1]):
                s = s[:(i + 1)] + s[(i+2):]
                break
    
    print(s)
    
def __starting_point():
    main()

__starting_point()

import math as mt
import itertools as it
import functools as ft

stdin = lambda type_ = "int", sep = " ": list(map(eval(type_), input().split(sep)))
joint = lambda sep = " ", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)

n = int(input())
s = input()

i = 0
while i < len(s) - 1:
    if s[i] in "aeoiuy" and s[i + 1] in "aeiouy":
        s = s[:i + 1] + s[i + 2:]
        i -= 1
    i += 1

print(s)

def main():
    n = input()
    s = input()
    
    a= []
    for x in s:
        if x in 'aeiouy':
            if len(a)>0 and a[-1] in 'aeiouy':
                continue
            else:
                a.append(x)
        else:
            a.append(x)
            
    print(''.join(a))

    
def __starting_point():
    main()

__starting_point()

n = input()
word = input().strip()

def is_vowel(ch):
  return ch in ['a', 'e', 'i', 'o', 'u', 'y']

res = [word[0]]
for i in range(1, len(word)):
  if is_vowel(word[i]):
    if not is_vowel(word[i-1]):
      res.append(word[i])
  else:
    res.append(word[i])

print(''.join(res))


def vowel(t):
    if t == 'a' or t == 'e' or t == 'i' or t == 'o' or t == 'u' or t == 'y':
        return True
    else:
        return False
n = int(input())
s = input()
cur = 1
vow = vowel(s[0])
while cur < len(s):
    preVow = vow
    vow = vowel(s[cur])
    if preVow and vow:
        s = s[:cur] + s[cur+1:]
    else:
        cur += 1

print(s)


n = int(input())

w = ['a', 'e', 'i', 'o', 'u', 'y']
res = []

for c in input():
    if len(res) == 0:
        res.append(c)
        continue
    if c in w:
        if res[-1] in w:
            continue
    res.append(c)

print(''.join(res))


def ii():
    return int(input())
def mi():
    return map(int, input().split())
def li():
    return list(mi())

n = ii()
s = input().strip()
t = []
v = 'aeiouy'
i = 0
while i < n:
    t += [s[i]]
    if s[i] not in v:
        i += 1
        continue
    j = i + 1
    while j < n and s[j] in v:
        j += 1
    i = j
print(''.join(t))