F. Franco Haters Club
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

After $$$Baby Baraa$$$ has qualified to DAR, he knew that some people made TEENS CHALLENGE marathon for Ramadan. As he is a $$$master$$$ on codeforces, he ordered them to be a tester and problemsetter.

$$$Baby Baraa$$$ forgot that he has a hashing sheet that must be finished tomorrow, but there is no time to make a problem, so he made a nice small problem for you.

Given a string $$$s$$$ and its size $$$n$$$. Your task is to sort this string according to Franco Teens Language.

As $$$Baby Baraa$$$ was busy solving the hashing sheet, solve this problem for him.

Input

The first line of input contains one integer $$$n$$$ $$$(1≤n≤10^5)$$$ — the size of the string.

The second line of input contains string $$$s$$$ — the string to be sorted.

Output

Print $$$s$$$ sorted according to Franco Teens Language.

Examples
Input
22
WISH0BARAA0TO0REACH0CM
Output
AAAABCCEHHIMORRST0000W
Input
23
WELCOMETOTEENSCHALLENGE
Output
ACCEEEEEEGHLLLMNNOOSTTW
Input
3
YAY
Output
AYY
Note

Franco Teens Language consists of characters from 0 to 9 and A to Z by this order : 7AB5CDE6FGHI3JKL1MNO9PQR2ST0UV4WXYZ8.

This means that "YAY" is sorted to "AYY" because A is before Y in this language.