Problem Description

Lea wrote down a word and then replaced some of its letters with underscores _. She will now replace the underscores with other letters.

Lea considers a word to be pleasant if it does not contain 3 or more consecutive vowels, 3 or more consecutive consonants, and includes at least one uppercase letter L.

Hint: Vowels only include a, e, i, o, u, and all other letters are consonants.

Determine how many ways Lea can replace the underscores with uppercase letters to make the word pleasant.

Input Format

A single line containing a string representing the word Lea wrote.

It is guaranteed that the string contains at most 10 underscores and only includes uppercase letters and underscores.

Output Format

A single integer representing the number of ways.

Note: You need to use a 64-bit signed integer. In C/C++, use long long, and in Pascal, use int64.

Sample Input and Output

Sample Input #1

L_V

Sample Output #1

5

Sample Input #2

V__K

Sample Output #2

10

Sample Input #3

JA_BU_K_A

Sample Output #3

485

Notes/Hints

Data Range

For $100\%$ of the data, the string length $\le 100$.

Notes

This problem is scored according to the original COCI settings, with a full score of $70$.

The problem is translated from COCI2009-2010 CONTEST #1 T3 DOBRA.

见题面 Input 部分

见题面 Output 部分