Meli kalikamaka

No attempts yetTime limit1sMemory limit1024 MB

Problem

On some Polynesian islands, people speak a language with the following properties:

  • Words never contain repeated or long (drawn-out) vowels or consonants.
  • Every consonant is always followed by exactly one vowel. (a, e, i, o, and u are vowels; every other letter is a consonant.)
  • The language does not distinguish the sounds r and l, nor the sounds s and k.

When Polynesians adopt words or expressions from other languages, they change those words — according to certain rules — so that the islanders can pronounce them more comfortably. A slightly simplified version of these rules is as follows:

  • All long and extra-long vowels and consonants become short. For example, tee becomes te, toooo becomes to, and mokka becomes moka.
  • When several vowels come in a row, only the first one remains. For example, tea also becomes te.
  • Vowels are inserted between consecutive consonants and after a consonant at the end of a word. For simplicity, assume that a is always inserted. For example, ahv becomes ahava and onn becomes ona.
  • The sound r becomes l, and s becomes k. For example, kass becomes kaka and tervist becomes telavikata.

Write a program that "translates" the given text into Polynesian pronunciation according to the rules above.

Input

The input consists of a single line containing text made up of lowercase Latin letters az and spaces, with a length between 1 and 100 characters. The text neither begins nor ends with a space, and there is always exactly one space between two words.

Output

Print, on a single line, the Polynesian rendering of the text given in the input.