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

hide comments
salvatore13: 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
bravo1996: 2016-01-26 08:24:48

It seems that some question has odd charactors not 2*k
看起来有些问题中字符的数目是奇数

wroj: 2016-01-20 16:13:59

Just solved it. Nice and simple.

roka1: 2016-01-18 18:32:59

Guys, evetything works well.
First try and AC :D

avds444: 2016-01-06 02:31:09

@dmitrand36 : yes it is possible.

sid_d01: 2016-01-03 15:47:00

Ideone, codechef, my own compiler. All of them give correct outputs. But SPOJ says "wrong answer".

khan_786: 2015-12-23 02:45:46

there is a bug in compiler

dmitrand36: 2015-12-19 14:24:11

I solved this problem with JAVA,it's possible guys,try

elite_: 2015-12-13 14:48:14

@rudraraj_123:
yup, it worked

Last edit: 2015-12-13 14:49:03
Thomas Lehmann: 2015-12-02 10:26:02

That problem puzzles me. I guess I understood something wrong also I don't see what.
I solved the example but spoj says "wrong answer".
I guess it shouldn't be the problem to print out every second character of first half ...
Any hints possible? (I did it with all sequences until "z" -> ab, abcd, abcdef, and so on ...)


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