Jack is awesome. His friends call him little Einstein. To test him, his friends gave him a string. They told him to add the string with its reverse string and follow these rules:
- Every ith character of string will be added to every ith character of reverse string.
- Both string will contain only lower case alphabets(a-z).
- Eg:- a+a=b,a+c=d,z+a=a (Refer to sample test cases for more details)
First line contains a value N denoting number of test cases.
Next N lines contains string str.
For every string str output the string that Jack's friends wants from him.
1 <= N <= 10
1 <= str <= 10^5
for each input file.
Marks are awarded when all the testcases pass.