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
maazalam66: 2017-12-18 13:27:08

Done.

Last edit: 2017-12-18 13:48:49
Vaibhav Agnihotri: 2017-09-05 16:33:00

do we need to use 2d arrays?

softxide: 2017-08-08 18:40:34

the question wants you to imagine a 2d array in 1d and apply to and fro motion to it .

prakharvk: 2017-07-22 10:31:32

test cases giving same output but WA on submission

vishal3410: 2017-07-15 17:34:07

when i run it in ideone program runs successfully but here it is showing runtime error http://ideone.com/z4Uia3?

manish_nit97: 2017-06-30 12:32:27

Took me 1 hour 15 min to find a solution for 1D array and after such a struggle....AC IN 1 GO!!
Just follow the pattern and see instead of string try to solve:-
0 1 2 3
7 6 5 4
8 9 10 11....... you will get the logic....CHEERS:)

coder_at_work: 2017-06-26 10:32:24

No need to use arrays !

sajal_tikariha: 2017-05-18 15:14:06

@nilabja16180 you are right..

nitisha1: 2017-04-09 13:10:32

AC in one go!!!

ruchir_mathur: 2017-04-01 11:19:26

ac in one go!! xD


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