Magical Land of Alphabets Part 2: Capitalize

Having sucessfully passed her first test, she has now moved on to her second test.

For her second test, she is given a string ~S~ consisting of lowercase English letters and she has to capitalise every third letter in the string.

Again, lacking the knowledge of letters and alphabets, she needs your help to finally live in peace!

Input

The first line of input consists of a single integer ~n\ (1\leq n \leq 500)~.

The second line of input consists of a single string ~S~ with a length of ~n~.

~S~ consists of only lowercase english letters.

It is guaranteed atleast one non-vowel character will exist in the input string.

Output

Return the original string ~S~ after capitalising every third character.

Examples

Input 1

7
eulogia

Output 1

euLogIa

Input 2

11
programming

Output 2

prOgrAmmIng

Input 3

3
dry

Output 3

drY