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
sky_scraper: 2018-04-02 14:10:40

just store everything in matrix and print it accordingly

silenthawk: 2018-03-15 17:22:37

trett

fayaz_shaik: 2018-02-28 07:36:45


Last edit: 2018-02-28 07:36:55
pj10285: 2018-02-24 14:49:21

how to check end of input??

srjsunny: 2018-02-06 16:42:14

use strings , size()/(size of column) and reverse() and then see that difference between the indexes will be the column number entered.

abhi007rider: 2018-01-28 18:02:11

Ac in single go !! damnn good!!

rahularity: 2018-01-14 21:14:04

you can do it really fast and efficiently.......watch the pattern :)

sonuverma: 2018-01-02 15:06:58

my 100th :-)

codesniper99: 2017-12-27 08:57:22

I ROCK YOU PAPER.

keshavsharma: 2017-12-25 16:05:55

why the hell im getting compilation error here but its running successfully on ideone , wtf so irritating, checked everything, language-option , code, etc etc no shit !!XD


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