STRHH - Half of the half

Given a sequence of 2*k characters, please print every second character from the first half of the sequence. Start printing with the first character.

Input

In the first line of input you are given the positive integer t (1<=t<=100) - the number of test cases. In the each of the next t lines, you are given a sequence of 2*k (1<=k<=100) characters.

Output

For each of the test cases please please print every second character from the first half of a given sequence (the first character should appear).

Example

Input:
4
your 
progress 
is 
noticeable

Output:
y
po
i
ntc

Added by:kuszi
Date:2012-09-01
Time limit:1s-1.289s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64

hide comments
2016-02-14 11:18:05
My compiler gives the right answer but spoj says wrong answer. Is there something in the framing of question that I am missing?
2016-02-08 21:00:12
Hah, done it in first approach! :) One dynamic string table and couple of for loops :)

Last edit: 2016-02-08 21:00:29
2016-01-26 08:24:48
It seems that some question has odd charactors not 2*k
看起来有些问题中字符的数目是奇数
2016-01-20 16:13:59
Just solved it. Nice and simple.
2016-01-18 18:32:59
Guys, evetything works well.
First try and AC :D
2016-01-06 02:31:09
@dmitrand36 : yes it is possible.
2016-01-03 15:47:00
Ideone, codechef, my own compiler. All of them give correct outputs. But SPOJ says "wrong answer".
2015-12-23 02:45:46
there is a bug in compiler
2015-12-19 14:24:11
I solved this problem with JAVA,it's possible guys,try
2015-12-13 14:48:14
@rudraraj_123:
yup, it worked

Last edit: 2015-12-13 14:49:03
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.