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
y = input()
arr1 = raw_input()
arr = [0,0,0,0,0,0]
for x in arr1:
	if(x is 'a'):
		arr[0]+=1
	if(x is 'e'):
		arr[1]+=1
	if(x is 'i'):
		arr[2]+=1
	if(x is 'o'):
		arr[3]+=1
	if(x is 'u'):
		arr[4]+=1
if(arr[0]!=0 and arr[1]!=0 and arr[2]!=0 and arr[3]!=0 and arr[4]!=0):
	print "YES"
else:
	print "NO"