Superstring#2246
A superstring consists of Latin alphabet letters. The vowels are considered to be the letters a, e, i, o, u, y, A, E, I, O, U, Y. You need to calculate the number of ways to split the given superstring into words. A word is a sequence of letters containing at least one vowel letter.
The length of a string does not exceed characters. The number of possible partitions does not exceed 2 \times 10^9.
The first line contains the number (1 \leq n \leq 50000). Then superstrings are given.
Print numbers — the number of possible ways to split the corresponding superstring.
Example 1