PivotOJ

DOBRA

시간 제한: 1000ms메모리 제한: 128MB출처: COCI 2009-2010BOJ 2922

문제

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
출력
5

예제 2

입력
V__K
출력
10

예제 3

입력
JA_BU_K_A
출력
485
코드를 제출하려면 로그인하세요.