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())
s=raw_input()
vowels=[]
check=[1,1,1,1,1]
for i in range(n):
 ch=s[i]
 if ch=='a' and check[0]==1:
   vowels.append(ch)
   check[0]=0
 elif ch=='e' and check[1]==1:
   vowels.append(ch)
   check[1]=0
 elif ch=='i' and check[2]==1:
   vowels.append(ch)
   check[2]=0
 elif ch=='o' and check[3]==1:
   vowels.append(ch)
   check[3]=0
 elif ch=='u' and check[4]==1:
   vowels.append(ch)
   check[4]=0
vowels.sort()
if vowels==['a','e','i','o','u']:
 print "YES"
else:
 print "NO"