Problem: This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.

You are given a string s, consisting of lowercase English letters. Find the longest string, t, which satisfies the following conditions: 

  * The length of t does not exceed the length of s. 
  * t is a palindrome. 
  * There exists two strings a and b (possibly empty), such that t = a + b ( "+" represents concatenation), and a is prefix of s while b is suffix of s. 

Input

The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000), the number of test cases. The next t lines each describe a test case.

Each test case is a non-empty string s, consisting of lowercase English letters.

It is guaranteed that the sum of lengths of strings over all test cases does not exceed 5000.

Output

For each test case, print the longest string which satisfies the conditions described above. If there exists multiple possible solutions, print any of them.

Example

Input


5
a
abcdfdcecba
abbaxyzyx
codeforces
acbba


Output


a
abcdfdcba
xyzyx
c
abba

Note

In the first test, the string s = "a" satisfies all conditions.

In the second test, the string "abcdfdcba" satisfies all conditions, because:

  * Its length is 9, which does not exceed the length of the string s, which equals 11. 
  * It is a palindrome. 
  * "abcdfdcba" = "abcdfdc" + "ba", and "abcdfdc" is a prefix of s while "ba" is a suffix of s. 



It can be proven that there does not exist a longer string which satisfies the conditions.

In the fourth test, the string "c" is correct, because "c" = "c" + "" and a or b can be empty. The other possible solution for this test is "s".

Solution (in PYTHON3):

Solution:
import sys

cachedPow = {}
PRIME = 31
MOD = 2 ** 61 - 1  # TLE'd with this mod
MOD = 10 ** 9 + 7


class RabinKarpRollingHash:
    def __init__(self, s):
        n = len(s)

        # Build polynomial hash where prefix[k] is hash of s[0:k]
        # prefix[i + 1] = (
        #   s[0]     * (PRIME **  i     ) +
        #   s[1]     * (PRIME ** (i - 1)) +
        #   s[2]     * (PRIME ** (i - 2)) +
        #   ...
        #   s[i - 2] * (PRIME **  2     ) +
        #   s[i - 1] * (PRIME **  1     ) +
        #   s[i]     * (PRIME **  0     )
        # )
        prefix = [0] * (n + 1)
        for i in range(n):
            # Note: assumes lowercased letters
            # The +1 is because we don't want a and aaaaa to both hash to 0
            prefix[i + 1] = (prefix[i] * PRIME + ord(s[i]) - ord("a") + 1) % MOD

        # Exponentiating is expensive since bigints: `PRIME ** k`
        # We could use python's mod pow to keep numbers small: `pow(PRIME, k, MOD)`
        # But since we know we need all the powers from 0 to n,
        # can just precompute them instead
        if n not in cachedPow:
            cachedPow[0] = 1
            for i in range(n):
                cachedPow[i + 1] = (cachedPow[i] * PRIME) % MOD

        self.prefix = prefix

    def getHash(self, i, j):
        # Inclusive i, exclusive j
        return (self.prefix[j] - self.prefix[i] * cachedPow[j - i]) % MOD


def solve(s):
    # Find min value of a and b
    n = len(s)
    minAB = 0
    for i in range(n):
        if i < n - 1 - i and s[i] == s[n - 1 - i]:
            minAB = i + 1
        else:
            break

    if minAB == len(s) // 2:
        # Whole string works
        return s

    forward = RabinKarpRollingHash(s)
    backward = RabinKarpRollingHash(s[::-1])

    def isPalindrome(i, j):
        # Check if palindrome checking whether s[i:j] == s[i:j][::-1]
        # which is equivalent to checking s[i:j] == s[::-1][n-j:n-i]
        return forward.getHash(i, j) == backward.getHash(n - j, n - i)

    best = (2 * minAB, minAB, minAB)
    for l in range(n - 2 * minAB, -1, -1):
        if isPalindrome(minAB, minAB + l):
            # Find longest palindrome prefix in s[minAB: -minAB]
            a = minAB + l
            b = minAB
            best = max(best, (a + b, a, b))
            break
        elif isPalindrome(n - minAB - l, n - minAB):
            # Find longest palindrome suffix in s[minAB: -minAB]
            a = minAB
            b = minAB + l
            best = max(best, (a + b, a, b))
            break

    l, a, b = best
    return s[:a] + s[n - b :]


if __name__ == "__main__":
    input = sys.stdin.readline
    answers = []
    T = int(input())
    for t in range(T):
        S = input().rstrip()
        answers.append(solve(S))
    print("\n".join(answers))