#C3844. Count Species Codes Containing Vowels

    ID: 47316 Type: Default 1000ms 256MiB

Count Species Codes Containing Vowels

Count Species Codes Containing Vowels

Given a list of species codes, your task is to determine how many of these codes contain at least one vowel. For the purpose of this problem, the vowels are defined as \(a, e, i, o, u\). The input consists of an integer followed by that many species codes. Your program should output the number of codes that contain at least one vowel.

For example, if the species codes are ["cactus", "fern", "sequoia", "spruce", "pine"], the correct output is 3 because three of these codes contain a vowel.

inputFormat

The input is provided via standard input (stdin). The first line contains a single integer \(n\) denoting the number of species codes. Each of the following \(n\) lines contains one species code as a non-empty string.

outputFormat

Output a single integer to standard output (stdout) representing the number of species codes that contain at least one vowel (\(a, e, i, o, u\)).

## sample
5
cactus
fern
sequoia
spruce
pine
3