Submit solution

Points: 5
Time limit: 2.0s
Memory limit: 64M

Author:
Problem type

Every word in the English language must contain at least one vowel [aeiou]. In addition no English word may have more than 2 consecutive vowels. For example aabeecaa may be a real English word however ytfhg and beauty are not. Given a list of words, determine how many of them are definitely not English.

Input Specification

The first line of input contains n (1 \le n \le 10^5) representing the number of words that must be checked.
The next n lines each contain a word with only lowercase letters.

Output Specification

Print how many of the n words are definitely not English words.

Sample Input

4
saidoj
pol
afggueia
lkm

Sample Output

2

Comments

There are no comments at the moment.