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".
n = int(raw_input())
s = raw_input()

ar = s
j = 0

length = len(s)

new_ar = [s]

sp = True

while j < n:
    x,y = "",""
    i = 0
    while i < length:
        if i%2 == 0:
            x = x + ar[i]
        else:
            y = y + ar[i]
        i = i + 1
    ar = x + y[::-1]
    
    if ar in new_ar:
    	print new_ar[n % len(new_ar)]
    	sp = False
    	break
    else:
    	new_ar.append(ar)
    j = j + 1
    

if sp:
	print ar