Wovels
You are given a string S that contains N lowercase letters of the Englush alphabet. How many wovels does the string S contain? (only the letters 'a', 'e', 'i', 'o' and 'u' are considered to be wovels - letter 'y' is not considered to be a wovel)
InputFrom the first line of the standard input read an integer N (1 <= N <= 1000), N represents the length of the given string. From the second line of the standard input read N characters that represent the string S.
OutputTo the standard output, output one integer that represents the number of wovels that S contains
Inpyt:
Output:
Explanation:
The only wovels in the strings are 'o', 'u' and 'e', however 'e' occurs twice, and we count it both times.
10
obhtueekxyOutput:
4Explanation:
The only wovels in the strings are 'o', 'u' and 'e', however 'e' occurs twice, and we count it both times.
Input:
Output:
5
aeiouOutput:
5Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.