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".
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
#print 'Hello World!'
def calculate(st):
	snew=""
	in1 = 0
	in2=len(st)-1
	flag=True
	while flag:
		snew=snew+st[in1]
		snew=snew+st[in2]
		in1=in1+1
		in2=in2-1
		if in1>in2:
			break
	if(len(st)%2==1):
		return snew[:len(snew)-1]	
	return snew	
		
k=int(raw_input())
s=raw_input()
l=len(s)
per=0
sr=s
while True:
	per=per+1
	tm=calculate(sr)
	#print tm
	if s==tm:
		break
	sr=tm
	
#print per
k=k%per
if l%2==2:
	c=per-k-1
else:
	c=per-k
i=0
#print c
while i<c:
	s=calculate(s)
	#print s
	i=i+1
print s