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".
k=input()
string =  raw_input()
str1 = list(string)
part1 = []
part2 = []
length = len(str1)
count = 1

while True:
  for i in range(0, length, 2):
    part1.append(str1[i])
    if( i+1 < length):
      part2.append(str1[i+1])
  str1 = part1 + part2[::-1]
  part1  =[]
  part2 = []
  string1 = ''.join(str1)
  if string == string1:
    break
  count +=1

count1 = k % count;
str1 = list(string)
while(count1>0):
  count1 -=1
  for i in range(0, length, 2):
    part1.append(str1[i])
    if( i+1 < length):
      part2.append(str1[i+1])
  str1 = part1 + part2[::-1]
  part1  =[]
  part2 = []

print ''.join(str1)