Description

Given a string composed of simply lowercase letters, you are asked to erase all its vowels (a, e, i, o, u). That’s truly a breeze to you!

Input

The first line of input contains a number T (1<T<50), which is the number of test cases. Each of the following T lines contains one string formed by merely lowercase ASCII letters, and its length won’t exceed 100.

Output

For each test case, print a line the modified string corresponding to the original string. It’s guaranteed that the modified string won’t be an empty string.

Sample

Input

2
vaio
hakunamatata

Output

v
hknmtt

Source: Limitfan