All Tracks Data Structures Hash Tables Basics of Hash Tables Problem

All Vowels
/

Ad-Hoc, Basic Programming

Problem
Editorial
Analytics

Vowels are very essential characters to form any meaningful word in English dictionary. There are 5 vowels in English language - a, e, i, o u. You are given a randoms string containing only lowercase letters and you need to find if the string contains ALL the vowels.

Input:

FIrst line contains N , the size of the string.
Second line contains the letters (only lowercase).

Output:

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

Constraints:

The size of the string will not be greater than 10,000
1 ≤ N ≤ 10000

SAMPLE INPUT
8
atuongih
SAMPLE OUTPUT
NO
Time Limit: 2.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB

Best Submission

Similar Problems

Contributors

Initializing Code Editor...
Notifications
View All Notifications

?