John was concerned about the privacy of his chats. So, he has come up with a method of keeping his messages secret. Basically he has made use of swapping to keep his message secret. The method that he was thinking about is something like this- a single swap means that the character at the ith position from the end is to be inserted in between the ith position and (i+1)th position from the beginning. He can perform the swapping any number of times he wants to. This process starts from the first position (ie, i=0).

Now, John has obtained the secret message using his method. But, now he himself cannot decipher he original message from the obtained secret message. Help John get back the original message from the secret message.

INPUT FORMAT

The first line contains an integer n which denotes the number of swaps that were performed.

The second line contains the string S on which the swapping mechanism is to be applied. (All the characters in S are lowercase alphabets.)

OUTPUT FORMAT

A string S, which denotes the original message.

Constraints:

1<=n<=10^9

3<=Length(s)<=1000