This is the assignment you got for low attendance :P

There are T testcases.

For each testcase, you are given a string 'S'.

You need to modify 'S' by deleting any one of the two consecutive "equal" letters in 'S'.

Thus, modified 'S' should not have any two consecutive letters equal.

Output modified 'S' after applying all operations.

Input:

The first line contains an integer T, denoting the number of test cases.

Each test case consists of a string S.

Note: 'S' consists of only lower case letters.

Output:

For each test case, print the answer to the given problem.

Constraints:

1 <= T <= 10

1 <= |S| <= 30