Sherlock and Watson are playing swapping game. Watson gives to Sherlock a string S on which he has performed K swaps. You need to help Sherlock in finding the original string.  
One swap on a string is performed in this way:   
Assuming 1 indexing, the i'th letter from the end is inserted
   between i'th and (i+1)'th letter from the starting.

For example, we have "contest". After one swap, it would change to "ctosnet".
Check this image:

Input: 
First line contains K, the number of swaps performed by Watson. Next line contains S, the string Watson gives to Sherlock.

Output: 
You have to print in one line the original string with which Watson had started.     

Constraints: 
1 ≤ K ≤ 10^9 
3 ≤ Length(S) ≤ 1000  
All characters in S will be small English alphabets.

SAMPLE INPUT
3
hrrkhceaate

SAMPLE OUTPUT
hackerearth

Explanation

When swapping is done on "hackerearth" 3 times, it transforms to "hrrkhceaate".
def unswap(word, length):
    result = ""
    for i in range(length + 1):
        result += word[i]
        word = word[:i] + word[i + 1:]
    result += word[::-1]
    return result

itercount = input()
word = raw_input()
length = (len(word) // 2) - (len(word) % 2 == 0)
copy = word[:]
i = 1
res = unswap(word, length)
while res != copy:
    res = unswap(res, length)
    i += 1
itercount = itercount % i
for i in range(itercount):
    word = unswap(word, length)
print word