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.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
import java.text.*;
public class Prac{     
    static class InputReader { 
        private final InputStream stream;
        private final byte[] buf = new byte[8192];
        private int curChar, snumChars;
        public InputReader(InputStream st) {
            this.stream = st;
        } 
        public int read() {
            if (snumChars == -1)
                throw new InputMismatchException();
            if (curChar >= snumChars) {
                curChar = 0;
                try {
                    snumChars = stream.read(buf);
                } 
                catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (snumChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }
        public int ni() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        } 
        public long nl() {
            int c = read();
            while (isSpaceChar(c)) {
            c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        } 
        public int[] nia(int n) {
            int a[] = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = ni();
            }
            return a;
        } 
        public String rs() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                    c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }
        public String nextLine() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        } 
        public boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
 
        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        } 
    }
    public static class Key {

        private final int x;
        private final int y;

        public Key(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (!(o instanceof Key)) return false;
            Key key = (Key) o;
            return x == key.x && y == key.y;
        }

        @Override
        public int hashCode() {
            int result = x;
            result = 31 * result + y;
            return result;
        }

    }
    
    static PrintWriter w = new PrintWriter(System.out);
    static long mod=998244353L,mod1=1000000007;
    static char arr[];
    static String ans="";
    
    
   
    static int findLongestPalindromicString(char arr[])  
    { 
        int N = arr.length; 
        
        N = 2 * N + 1; // Position count 
        int[] L = new int[N + 1]; // LPS Length Array 
        
        if (N == 0) 
            return 0; 
        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) ||  
                         (arr[(i + L[i] + 1) / 2] ==  
                          arr[(i - L[i] - 1) / 2]))) 
            { 
                L[i]++; 
            } 
  
            if (L[i] > maxLPSLength) // Track maxLPSLength 
            { 
                maxLPSLength = L[i]; 
                maxLPSCenterPosition = i; 
            } 
  
            // 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]); 
        } 
        int max=-1;
        for(int k=0;k<L.length;k++){
            if(k==L[k])max=k;
        }
        return max;
    } 
  
    public static void main(String [] args){
        InputReader sc=new InputReader(System.in);
        
        int t=sc.ni();
        while(t-->0){
            String s=sc.nextLine();
            ans="";
            arr=new char[s.length()];
//            Deque<Character> l=new LinkedList<>();
//            Deque<Character> r=new LinkedList<>();
            ArrayList<Character> l=new ArrayList<>();
            ArrayList<Character> r=new ArrayList<>();
            //Deque<Character> ans=new LinkedList<>();

            arr=s.toCharArray();
            int n=s.length();
            //String l="",r="";
            int i=0,j=n-1;
            while(i<=j&&arr[i]==arr[j]){
                //l=l+arr[i];
                l.add(arr[i]);
                if(i!=j){
                    //r=arr[j]+r;
                    r.add(arr[j]);
                }
                i++;j--;
            }
            if(i>j){
                //w.println(l+ans+r);
                for(int k=0;k<l.size();k++)w.print(l.get(k));
                for(int k=r.size()-1;k>=0;k--)w.print(r.get(k));
                w.println();
                continue;
            }
            char i1[]=new char[j-i+1];
            char i2[]=new char[j-i+1];
            for(int k=i;k<=j;k++){
                i1[k-i]=arr[k];
            }
            int x=0;
            for(int k=j;k>=i;k--){
                i2[x++]=arr[k];
            }
            int l1=findLongestPalindromicString(i1);
            int l2=findLongestPalindromicString(i2);
//            int l1[]=findLongestPalindromicString(x);
//            int l2[]=findLongestPalindromicString(x1);
//            for(int k=0;k<l1.length;k++){
//                w.print(l1[k]);
//            }
//            w.println();
//            for(int k=0;k<l2.length;k++){
//                w.print(l2[k]);
//            }
//            w.println();
            for(int k=0;k<l.size();k++)w.print(l.get(k));
            if(l1>l2){
                for(int k=i;k<i+l1;k++)w.print(arr[k]);
            }
            else{
                for(int k=j;k>j-l2;k--)w.print(arr[k]);
            }
            
            for(int k=r.size()-1;k>=0;k--)w.print(r.get(k));
            
            //w.println(l+ans+r);
            w.println();
        }
        w.close();
    }
}