In the world of Latin Alphabets, there seemed to be a catastrophe! All the vowels went missing. The other alphabets got disturbed and began the search operation.
While searching they stumbled upon a garbage of letters. Can you help them find if the this garbage contains ALL the vowels ?  

Input:
FIrst line contains N , the size of the garbage of letters.
Second line contains the letters (only lowercase).  

Output:
Print "YES" (without the quotes) if all vowels are found in the garbage, "NO" (without the quotes) otherwise.   

Constraints:
1 ≤ N ≤ 10000  

SAMPLE INPUT
8
atuongih

SAMPLE OUTPUT
NO
N = int(raw_input(''))
W = raw_input('')
a, e, i, o, u = 0, 0, 0, 0, 0
for x in xrange(N):
	if W[x]=='a':
		a=1
	elif W[x]=='e':
		e=1
	elif W[x]=='i':
		i=1
	elif W[x]=='o':
		o=1
	elif W[x]=='u':
		u=1
if a==1 and e==1 and i==1 and o==1 and u==1:
	print "YES"
else:
	print "NO"