An archivist is cataloguing a long scroll represented as a string s of n lowercase English letters, one rune per position. Five particular letters -- a, e, i, o, u -- are considered resonant runes; every other letter is dormant.

For every contiguous stretch of the scroll (there are exactly n(n+1)/2 such stretches, including single runes and the whole scroll), the archivist counts how many resonant runes that stretch contains. Compute the sum of these counts over every contiguous stretch of the scroll.

Input format

A single line containing the string s.

Output format

Print a single integer: the sum, over every contiguous stretch of s, of the number of resonant runes it contains.

Constraints

• 1 <= length of s <= 100000
• s consists only of lowercase English letters ('a'-'z').
• The answer may be large; use a 64-bit (or arbitrary-precision) integer type.

aba

6

bcd

0