P6409 [COCI 2008/2009 #3] KEMIJA

Luka daydreams in class every day.

Luka is messing around again in chemistry class! Instead of writing chemical equations, he is writing a strange sentence. Luka encrypts a word by, after each vowel letter ($\texttt{a}$, $\texttt{e}$, $\texttt{i}$, $\texttt{o}$, $\texttt{u}$), adding $\texttt{p}$ and then adding the original vowel again. For example, $\texttt{kemija}$ becomes $\texttt{kepemipijapa}$, and $\texttt{paprika}$ becomes $\texttt{papapripikapa}$. The teacher wants to know what naughty Luka wrote. Please help the teacher by writing a decryption program.

One line with a string $s$, representing the encrypted sentence. The testdata guarantees there are no leading or trailing spaces, but spaces may appear in the middle of the sentence.

One line with a string, representing the decrypted sentence.

#### Constraints Let $|s|$ be the length of $s$. Then $1 \leq |s| \leq 100$. The testdata guarantees that the string contains only lowercase letters or spaces. #### Explanation **Translated from [COCI2008-2009](https://hsin.hr/coci/archive/2008_2009/) [CONTEST #3](https://hsin.hr/coci/archive/2008_2009/contest3_tasks.pdf) *T2 KEMIJA*.** Translated by ChatGPT 5