Count vowels
Given a string s, you would like to calculate the number of substrings that have an odd number of vowels (a, e, i, o, u, and y).
Definition of a substring
Any contiguous sequence of characters in the string s is considered a substring of s. For instance, the string abc has substrings a, b, c, ab, bc, abc.
Input
The input contains a single string s (1 ≤ |s| ≤ 100) of lowercase Latin letters.
Output
The program should print the number of substrings that have an odd number of vowels.
Examples
Input | Output |
|---|---|
abc | 3 |
hello | 9 |
xyz | 4 |
Explanation
abc → a, ab, abc
hello → he, hel, hell, e, el, ell, llo, lo, o
xyz → xy, xyz, y, yz
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB