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 = int(raw_input())
s = raw_input()
l = len(s)


def swap(s):
	j = l - 1
	while j:
		if not j % 2 == 0:
			e = s[j]
			s = s[:j] + s[j + 1:] + e
		j -= 1
	return s

c = s
count = 0
itr = ""
while itr != s:
	itr = swap(c)
	c = itr
	count += 1
	
count = k % count

for i in range(count):
	s = swap(s)
	
print s