You are given a string $S$ of length $N$ consisting of lowercase English letters. Find the total number of vowels in $S$, that is, the total number of occurrences of a, i, u, e, and o.

Input

The input is given from Standard Input in the following format:

$$ \begin{aligned} &N \\ &S \end{aligned} $$

Output

Output the total number of vowels in $S$, that is, the total number of occurrences of a, i, u, e, and o.

Constraints

• $1 \le N \le 50$.
• $S$ is a string of length $N$.
• Each character of $S$ is a lowercase English letter.

Examples

Input 1

8
joiyosen

Output 1

4

Note 1

• There are $4$ vowels: _oi_o_e_.

Input 2

6
bitaro

Output 2

3

Note 2

• There are $3$ vowels: _i_a_o.