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 JAVA):

Solution:
import java.io.IOException;
import java.io.InputStream;
import java.util.*;


public class Solution {
    static int n;
    static boolean dp[][];

    public static boolean check(int x, int y) {
        if (x >= 0 && y >= 0 && dp[x][y])
            return true;
        return false;
    }

    public static void main(String[] args) throws IOException {
        FastReader in = new FastReader(System.in);
        StringBuilder sb = new StringBuilder();
        int i, j;
        int t = in.nextInt();
        char a, b;
        while (t-- > 0) {
            char arr[] = in.next().toCharArray();
            n = arr.length;
            dp = new boolean[n + 1][n + 1];
            boolean table[][] = new boolean[n][n];

            // All substrings of length 1 are palindromes
            int maxLength = 1;
            for (i = 0; i < n; ++i)
                table[i][i] = true;

            // check for sub-string of length 2.
            int start = 0;
            for (i = 0; i < n - 1; ++i) {
                if (arr[i] == arr[i + 1]) {
                    table[i][i + 1] = true;
                    start = i;
                    maxLength = 2;
                }
            }

            // Check for lengths greater than 2. k is length
            // of substring
            for (int k = 3; k <= n; ++k) {

                // Fix the starting index
                for (i = 0; i < n - k + 1; ++i) {
                    // Get the ending index of substring from
                    // starting index i and length k
                    j = i + k - 1;

                    // checking for sub-string from ith index to
                    // jth index iff str.charAt(i+1) to
                    // str.charAt(j-1) is a palindrome
                    if (table[i + 1][j - 1] && arr[i] ==
                            arr[j]) {
                        table[i][j] = true;

                        if (k > maxLength) {
                            start = i;
                            maxLength = k;
                        }
                    }
                }
            }
            dp[0][0] = dp[0][1] = dp[1][0] = true;
            for (i = 0; i <= n; i++) {
                for (j = 0; j <= (n - i); j++) {
                    int x = Math.min(i, j);
                    if (dp[x][x] || (i == j && dp[i - 1][j - 1] && arr[i - 1] == arr[n - j])) {
                        if (i == j) {
                            if (check(i - 1, j - 1) && arr[i - 1] == arr[n - j])
                                dp[i][j] = true;
                        } else if (i > j) {
                            if (table[j][i - 1])
                                dp[i][j] = true;
                        } else {
                            if (table[n-j][n-1-i])
                                dp[i][j] = true;
                        }
                    }
                }
            }
            int ans = 0,maxi=0,maxj=0;
            for (i = 0; i <= n; i++) {
                for (j = 0; j <= (n - i); j++) {
                    if (dp[i][j]) {
                        //System.out.println(i+" "+j);
                        if(i+j>ans) {
                            ans = i + j;
                            maxi=i;
                            maxj=j;
                        }
                    }
                }
            }
            for(i=0;i<maxi;i++)
                sb.append(arr[i]);
            for(j=n-maxj;j<n;j++)
                sb.append(arr[j]);
            sb.append("\n");

        }
        System.out.println(sb);

    }
}
class FastReader {

    byte[] buf = new byte[2048];
    int index, total;
    InputStream in;

    FastReader(InputStream is) {
        in = is;
    }

    int scan() throws IOException {
        if (index >= total) {
            index = 0;
            total = in.read(buf);
            if (total <= 0) {
                return -1;
            }
        }
        return buf[index++];
    }

    String next() throws IOException {
        int c;
        for (c = scan(); c <= 32; c = scan()) ;
        StringBuilder sb = new StringBuilder();
        for (; c > 32; c = scan()) {
            sb.append((char) c);
        }
        return sb.toString();
    }

    int nextInt() throws IOException {
        int c, val = 0;
        for (c = scan(); c <= 32; c = scan()) ;
        boolean neg = c == '-';
        if (c == '-' || c == '+') {
            c = scan();
        }
        for (; c >= '0' && c <= '9'; c = scan()) {
            val = (val << 3) + (val << 1) + (c & 15);
        }
        return neg ? -val : val;
    }

    long nextLong() throws IOException {
        int c;
        long val = 0;
        for (c = scan(); c <= 32; c = scan()) ;
        boolean neg = c == '-';
        if (c == '-' || c == '+') {
            c = scan();
        }
        for (; c >= '0' && c <= '9'; c = scan()) {
            val = (val << 3) + (val << 1) + (c & 15);
        }
        return neg ? -val : val;
    }
}