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
'''

def main():
        
        k=int(input())
        s=[]
        s.extend(str(raw_input()))
        temp=2
        l=int(len(s))
        
            
        if int(l%2)==0:
                temp=3
        l=l-temp
        
        nS=''.join(s)
        index=0
        while k>0:
                count=0
                index=index+1
                for i in range(l,0,-2):
                        
                        c=s.pop(i)
                        s.append(c)
                if ''.join(s)==nS:
                	k=(k%index)
                	nS=""
                
                k=k-1
        print(''.join(s))   
        
        
        
        
            
           
            
        
            

if __name__ == "__main__":
    main()