Let's take an arbitrary word and perform the following operation with it: swap its first consonant with the last consonant, the second consonant with the penultimate consonant, and so on. If after this operation we again get the original word, then we will call such a word a silent palindrome. For example, the words sos, rare, rotor, gong, karaoke are implicit palindromes.
You need to write a program that determines if a given word is a silent palindrome.
Input
One word is entered.
Imprint
The program should output YES if the word entered is a non-vowel palindrome, and NO otherwise.
Examples
| # |
Input |
Output |
| 1 |
tennete |
YES |