TOANDFRO - To and Fro

Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with extra random letters so as to make a rectangular array of letters. For example, if the message is “There’s no place like home on a snowy night” and there are five columns, Mo would write down

t o i o y
h p k n n
e l e a i
r a h s g
e c o n h
s e m o t
n l e w x

Note that Mo includes only letters and writes them all in lower case. In this example, Mo used the character ‘x’ to pad the message out to make a rectangle, although he could have used any letter. Mo then sends the message to Larry by writing the letters in each row, alternating left-to-right and right-to-left. So, the above would be encrypted as

toioynnkpheleaigshareconhtomesnlewx

Your job is to recover for Larry the original message (along with any extra padding letters) from the encrypted one.

Input

There will be multiple input sets. Input for each set will consist of two lines. The first line will contain an integer in the range 2...20 indicating the number of columns used. The next line is a string of up to 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end of input.

Output

Each input set should generate one line of output, giving the original plaintext message, with no spaces.

Example

Input:
5
toioynnkpheleaigshareconhtomesnlewx
3
ttyohhieneesiaabss
0

Output:
theresnoplacelikehomeonasnowynightx
thisistheeasyoneab

Added by:Adrian Kuegel
Date:2005-07-09
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource: ACM East Central North America Regional Programming Contest 2004

hide comments
2014-12-30 16:20:29 Abhishek Naik
What about the number of rows?

Last edit: 2014-12-30 16:36:27
2014-12-14 10:12:24 shreya
i am getting correct output for the given test cases.But when i submitted,it is showing wrong answer :(.what are the other test cases?
2014-12-12 12:25:22 Swapnil Borse
Didn't expect this on SPOJ :P
2014-12-10 15:06:42 MKM
Somebody please provide a solid test case! :(
2014-11-20 21:25:05 hit_code
http://ideone.com/e.js/nFLWYw getting correct on iodene but wron answer why?
2014-11-20 20:49:17 hit_code
passing the testcase? but wrong answer
2014-09-30 16:49:31 Lehar
Nice ques! AC in third go..Learnt a lot, specially how to handle memory while using strings.

Last edit: 2014-09-30 16:49:49
2014-08-30 19:02:51 ashish kumar
after a better approach i get it
2014-08-07 22:17:06 rituraj
got Green in 2nd due to one of my biggest silly mistake so far. EasyOne...
2014-08-02 07:58:43 Mythreyi.k
Good one!silly mistake costed me a wrong answer! completed in a single loop of o(n)!

Last edit: 2014-08-02 07:59:27
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.