Cyclic Vowel Replacement

Given a string s consisting of lowercase English letters, replace every vowel in the string with the next vowel in the cyclic order. The vowels follow the cyclic mapping: \(a \to e,\ e \to i,\ i \to o,\ o \to u,\ u \to a\).

Your task is to implement a program that reads a string from standard input and outputs the transformed string using the above cyclic replacement rule.

inputFormat

The input consists of a single line containing the string \(s\) (\(1 \leq |s| \leq 10^4\)), which is composed only of lowercase English letters.

outputFormat

Output the transformed string after replacing every vowel with the next vowel in the cyclic order.

hello

hillu