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

hide comments
RAJAT SINGH: 2014-02-05 12:19:45

got AC in second attempt.........but first one also giving correct ans codeblocks but i don't know why it is wrong in spoj compiler

Rahul Jain: 2013-11-12 11:15:28

I have done 2 problem worth of 0.02 and 0.01 points but I didn't get any point ..Why??
On solving this problem too, I didn't get any points.

Last edit: 2013-11-12 11:27:56
Shubham Goyal: 2013-11-02 08:52:14

can anyone please tell me what's wrong with this code....please....
http://www.spoj.com/submit/TOANDFRO/id=10402254

Last edit: 2013-11-02 08:53:03
Amey Telawane: 2013-06-04 10:22:20

nice problem :), HAD FUN

Ayush Sinha: 2013-02-26 16:48:34

I cannot understand the 2nd test case

arijit pande: 2012-12-10 05:42:44

Easy prob... I got 2 WA though... simply because of no newline..

Last edit: 2012-12-12 07:52:04
hua: 2012-09-16 05:07:00

Anyone who is stuck on this one: I've written a nice little explanation at http://www.swageroo.com/wordpress/spoj-problem-400-to-and-fro-toandfro/

Sriniketh Kovin: 2012-09-03 14:04:09

Had Fun with this one!!! Nice

Tom Mitter: 2012-08-23 15:23:59

This one was really enjoyable (albeit a bit easy)

nikoo28: 2012-07-25 00:44:39

can anyone give me a test case ...?? my solution is working with the inputs i provide..but i get a wrong answer here...please help


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