Problem C

The English language is notorious for its inconsistent spelling system. This problem focuses on the letter c. The letter c can be pronounced in several ways, which can confuse learners. Still, a few simple patterns help speakers choose the right pronunciation.

• It is pronounced as ⟨k⟩ if it is followed by a, o, or u, if it is followed by a consonant letter other than h and y, or if it is at the end of a word. Consonant letters are the English letters other than the vowel letters a, e, i, o, and u.
• It is pronounced as ⟨s⟩ if it is followed by e, i, or y.
• The adjacent pair ch has a unique sound ⟨c⟩.

You are given $N$ words $S_1, S_2, \dots, S_N$. For each word, replace every c with k or s according to the patterns above, and replace every ch with c.

The first line contains an integer $N$ ($1 \le N \le 100$). Each of the next $N$ lines contains a string $S_i$. $S_i$ consists of only lowercase English letters, and its length is between 1 and 100.

For each word, output one line containing the simplified spelling of $S_i$ under the patterns above.