Magical Land of Alphabets Part 1: Anti-Vowels

Having successfully escaped her dystopian land, Brooke has arrived on a planet ruled by many different alphabets. To gain entrance into the new world, she has two pass two tests.

For her first test, she is given a string ~S~ consisting of lowercase English letters and she has to remove all the vowels in the string ~S~.

Having lived in a world full of numbers all her life, she doesn't know much about vowels and requires your help!

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 length ~n~.

~S~ consists of only lowercase english letters.

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

Output

Return the state of the original string ~S~ with all vowels removed (vowels are defined as the characters a, e, i, o, and u).

Examples

Input 1

7
eulogia

Output 1

lg

Input 2

11
programming

Output 2

prgrmmng

Input 3

3
dry

Output 3

dry