Given a string $$S$$ of lowercase english alphabets of length $$N$$. You need to compress the string with the following rules:
$$1$$. Convert the first letter to the uppercase
$$2$$. Convert the substring consisting of all the consonants to the length of this substring (e.g. abcde to a3e)
$$3$$. Remove the consecutive duplicate vowels (e.g. aaaeiia to aeia)

Note: The first letter will not follow the rules 2 and 3.

Input Format
The first line of the input contains the number $$T$$, the total number of the test cases.
The first line of each test case contains the number $$N$$, the length of the string $$S$$.
The second line of each test case contains the string $$S$$.

Output Format
For each test case print the compressed string according to the above-mentioned rules.

Constraints
$$1 \le T \le 10^3$$
$$1 \le N \le 10^5$$
Sum of $$N$$ over all test cases doesn't exceed $$10^6$$