문제

Author: Filip Barl Lea runs into a lot of words in her life. A lot of them she finds unpleasant. To compensate for that she started making up plesant words. Lea makes up new words by writing a nice looking string of characters on a piece of paper. She than erases a few of the most nasty looking characters and replaces them with underscores '_'. After that she tries to replace the underscores with more acceptable characters trying to form a plesant word. Lea considers words plesant if they do not contain 3 sequential vowels, 3 sequential consonants and contain at least one letter 'L'. In Croatian vowels are letters A, E, I, O, U only. All other lettters are consonants.

입력

The first and only line of input contains a string of characters, at most 100. The string contains only of uppercase english letters and characters ''. There will be at most 10 characters ''.

출력

The first and only line of output should cotain a single integer - the total number of plesant words that can be formed by substituing underscores with uppercase letters of the english alphabet. Warning: Use 64 bit number formats. long long in C/C++, int64 in Pascal.

예제 입력 1

L_V

예제 출력 1

5

예제 입력 2

V__K

예제 출력 2

10

예제 입력 3

JA_BU_K_A

예제 출력 3

485