Nayaab wants to create a new language! She wants to make sure that every word in the language is easily pronounceable, so she decides that every word in the language must consist of alternating consonants and vowels. She comes up with some proposed words, but wants to figure out if they are easily pronounceable or not.

For the purposes of this problem, the letter y will count as a consonant.

Input Specification

The first and only line of input will consist of a word that Nayaab proposes, which will be no shorter than ~2~ letters and no longer than ~100~ letters. It is guaranteed that the string will only contain lowercase letters.

Output Specification

Output yes if the word is easily pronounceable according to the above rule, or no if the word is not easily pronounceable.

Sample Input 1

mogipew

Sample Output 1

yes

Sample Input 2

erifpo

Sample Output 2

no