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 pleasant words. Lea makes up new words by writing a nice looking string of characters on a piece of paper. She then 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 pleasant word.

Lea considers a word pleasant if it:

• does not contain \(3\) sequential vowels,
• does not contain \(3\) sequential consonants, and
• contains at least one letter L.

In Croatian, vowels are the letters A, E, I, O, U only. All other letters are consonants.

The first and only line of input contains a string of characters, at most \(100\) characters long. The string consists only of uppercase English letters and the character _. There will be at most \(10\) characters _.

The first and only line of output should cotain a single integ\(er - th\)e 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.

riseoj 작성

출처 COCI 2009/2010 Contest 1