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.*;
import java.util.Random;
import java.util.StringTokenizer;

public class D {

    public static void main(String[] args) {
        FastReader scan = new FastReader();
        PrintWriter out = new PrintWriter(System.out);
        Task solver = new Task();
        int t = scan.nextInt();
        for(int tt = 1; tt <= t; tt++) solver.solve(tt, scan, out);
        out.close();
    }

    static class Task {

        public void solve(int testNumber, FastReader scan, PrintWriter out) {
            String s = scan.next();
            if(s.equals(new StringBuilder(s).reverse().toString())) {
                out.println(s);
                return;
            }
            int i = 0, j = s.length() - 1;
            String best = "";
            while(true) {
                if(s.charAt(i) != s.charAt(j)) break;
                i++;
                j--;
            }
            String left = s.substring(i, j + 1);
            String revLeft = new StringBuilder(left).reverse().toString();
            String a = findLongestPalindromicString(left), b = findLongestPalindromicString(revLeft);
            //System.out.println(a + " " + b);
            for(int ii = 0; ii < i; ii++) out.print(s.charAt(ii));
            if(a.length() > b.length()) out.print(a);
            else out.print(b);
            for(int jj = j + 1; jj < s.length(); jj++) out.print(s.charAt(jj));
            out.println();
        }

        static String longestPrefix(String x) {
            String res = new String(x);
            System.out.println(x);
            x = res + "#" + (new StringBuilder(x).reverse().toString());
            int len = 0;
            int[] a = new int[x.length() + 100];
            int i = 0, j = 1;
            len = x.length();
            while(j < len){
                if(x.charAt(i) == x.charAt(j)){
                    a[j] = i+1;
                    i++; j++;
                } else {
                    if(i>=1){
                        i = a[i-1];
                    }else{
                        a[j] = 0;
                        j++;
                    }
                }
            }
            int ans = res.length() - a[len-1];
            System.out.println(ans);
            return res.substring(0, ans);
        }

        static String findLongestPalindromicString(String text)
        {
            int bestEnd = 0;
            int N = text.length();
            N = 2 * N + 1; // Position count
            int[] L = new int[N + 1]; // LPS Length Array
            L[0] = 0;
            L[1] = 1;
            int C = 1; // centerPosition
            int R = 2; // centerRightPosition
            int i = 0; // currentRightPosition
            int iMirror; // currentLeftPosition
            int maxLPSLength = 0;
            int maxLPSCenterPosition = 0;
            int start = -1;
            int end = -1;
            int diff = -1;

            // Uncomment it to print LPS Length array
            // printf("%d %d ", L[0], L[1]);
            for (i = 2; i < N; i++)
            {

                // get currentLeftPosition iMirror
                // for currentRightPosition i
                iMirror = 2 * C - i;
                L[i] = 0;
                diff = R - i;

                // If currentRightPosition i is within
                // centerRightPosition R
                if (diff > 0)
                    L[i] = Math.min(L[iMirror], diff);

                // Attempt to expand palindrome centered at
                // currentRightPosition i. Here for odd positions,
                // we compare characters and if match then
                // increment LPS Length by ONE. If even position,
                // we just increment LPS by ONE without
                // any character comparison
                while (((i + L[i]) + 1 < N && (i - L[i]) > 0) &&
                        (((i + L[i] + 1) % 2 == 0) ||
                                (text.charAt((i + L[i] + 1) / 2) ==
                                        text.charAt((i - L[i] - 1) / 2))))
                {
                    L[i]++;
                }

                if (L[i] > maxLPSLength) // Track maxLPSLength
                {
                    maxLPSLength = L[i];
                    maxLPSCenterPosition = i;
                }
                int currStart = (i - L[i]) / 2;
                if(currStart == 0) {
                    bestEnd = Math.max(bestEnd, currStart + L[i] - 1);
                }
                // If palindrome centered at currentRightPosition i
                // expand beyond centerRightPosition R,
                // adjust centerPosition C based on expanded palindrome.
                if (i + L[i] > R)
                {
                    C = i;
                    R = i + L[i];
                }

                // Uncomment it to print LPS Length array
                // printf("%d ", L[i]);
            }

//            start = (maxLPSCenterPosition - maxLPSLength) / 2;
//            end = start + maxLPSLength - 1;
//            System.out.printf("LPS of string is %s : ", text);
//            for (i = start; i <= end; i++)
//                System.out.print(text.charAt(i));
//            System.out.println();
//            System.out.println
//            if(bestEnd != 0) bestEnd++;
            return text.substring(0, bestEnd+1);
        }
    }

    static void shuffle(int[] a) {
        Random get = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = get.nextInt(a.length);
            int temp = a[i];
            a[i] = a[r];
            a[r] = temp;
        }
    }

    static void shuffle(long[] a) {
        Random get = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = get.nextInt(a.length);
            long temp = a[i];
            a[i] = a[r];
            a[r] = temp;
        }
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(new File(s)));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}