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.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;


public class Main
{	
   static long mod=(long)(1e+9 + 7);
   //static long mod=(long)998244353;
   
   static int[] sieve;
   static ArrayList<Integer> primes;
   static PrintWriter out;
   static fast s;
   static StringBuilder fans;
   
   public static boolean is_palin(String str)
   {
   	StringBuilder str1=new StringBuilder(str);
   	StringBuilder str2=new StringBuilder(str);
   	str2=str2.reverse();
   	
   	if(str1.toString().equals(str2.toString())) return true;
   	return false;
   }
   
   public static void solve()
   {
   	String str=s.nextLine();
   	StringBuilder tempo=new StringBuilder(str);
   	tempo=tempo.reverse();
   	String str1=new String(tempo.toString());
   	
   	int n=str.length();
   	
   	if(is_palin(str) || n==1) {System.out.println(str); return;}
   	
   	if(n==2)
   		{
   			if(is_palin(str)) System.out.println(str);
   			else System.out.println(str.charAt(0));
   			return;
   		}
   	
   	StringBuilder ans=new StringBuilder("");
   	
   	int dp[][]=new int[n][n];
   	int dp_end[][]=new int[n][n];
   	
   	for(int i=0;i<n;i++) dp[i][i]=1;
   	for(int i=0;i<n;i++) dp_end[i][i]=1;
   	
   	
   	for(int i=0;i<n-1;i++) 
   		{
   			if(str.charAt(i)==str.charAt(i+1)) dp[i][i+1]=2;
   			if(str1.charAt(i)==str1.charAt(i+1)) dp_end[i][i+1]=2;
   		}
   	
   	for(int len=3;len<=n;len++)
   		{
   			for(int i=0;i<=n-len;i++)
   				{
   					int j=i+len-1;
   					if(str.charAt(i)==str.charAt(j) && dp[i+1][j-1]>0)
   						dp[i][j]=dp[i+1][j-1]+2;
   					else
   					   dp[i][j]=0;
   					
   					if(str1.charAt(i)==str1.charAt(j) && dp_end[i+1][j-1]>0)
   						dp_end[i][j]=dp_end[i+1][j-1]+2;
   					else 
   						dp_end[i][j]=0;
   				}
   		}
   	
   	int max_len=1;
   	ans=new StringBuilder(str.charAt(0)+"");
   	
   	for(int i=0;i<n/2;i++)
   		{
   			if(str.charAt(i)==str.charAt(n-i-1))
   				{
   					//start
   					int maxi=1;
   					int start=i+1;
   					int end=i+1;
   					
   					for(int j=i+1;j<n;j++)
   						{
   							if(j>=(n-i-1)) break;
   							if(dp[i+1][j]>maxi)
   								{
   									maxi=dp[i+1][j];
   									start=i+1;
   									end=j;
   								}
   						}
   					
   					if(maxi+2*(i+1)>max_len)
   						{
   							max_len=maxi+2*(i+1);
   							ans=new StringBuilder("");
   							ans.append(str.substring(0,start));
   							ans.append(str.substring(start,end+1));
   							ans.append(str.substring(n-1-(i+1)+1,n));
   						}
   					
   					//end
   					maxi=1;
   					start=i+1;
   					end=i+1;
   					
   					for(int j=i+1;j<n;j++)
   						{
   							if(j>=(n-i-1)) break;
   							if(dp_end[i+1][j]>maxi)
   								{
   									maxi=dp_end[i+1][j];
   									start=i+1;
   									end=j;
   								}
   						}
   					
   					if(maxi+2*(i+1)>max_len)
   						{
   							max_len=maxi+2*(i+1);
   							ans=new StringBuilder("");
   							ans.append(str1.substring(0,start));
   							ans.append(str1.substring(start,end+1));
   							ans.append(str1.substring(n-1-(i+1)+1,n));
   						}
   					
   				}
   			else break;
   		}
   	
   	//start
		int maxi=1;
		int start=0;
		int end=0;
		
		for(int j=1;j<n;j++)
			{
				if(dp[0][j]>maxi)
					{
						maxi=dp[0][j];
						start=1;
						end=j;
					}
			}
		
		if(end+1>max_len)
			{
				max_len=end+1;
				ans=new StringBuilder("");
				ans.append(str.substring(0,end+1));
			}
		
		//end
		maxi=1;
		start=0;
		end=0;
		
		for(int j=1;j<n;j++)
			{
				if(dp_end[0][j]>maxi)
					{
						maxi=dp_end[0][j];
						start=1;
						end=j;
					}
			}
		
		if(end+1>max_len)
			{
				max_len=end+1;
				ans=new StringBuilder("");
				ans.append(str1.substring(0,end+1));
			}
   	System.out.println(ans);
   }
  
   public static void main(String[] args) throws java.lang.Exception
   {	  	
	     s = new fast();
	     out=new PrintWriter(System.out);
	     fans=new StringBuilder("");
		    
	     
	     int t=s.nextInt();
	    
	     while(t>0)
	    	 {
	    		 solve();
	    		 t--;
	    	 }
	     
	     //System.out.println(fans);
   }
  
 
 
static class fast {   
	
	    private InputStream i;
		private byte[]  buf = new byte[1024];
		private int curChar;
		
		private int numChars;
		
		//Return floor log2n
		public static long log2(long bits) // returns 0 for bits=0
			{
			    int log = 0;
			    if( ( bits & 0xffff0000 ) != 0 ) { bits >>>= 16; log = 16; }
			    if( bits >= 256 ) { bits >>>= 8; log += 8; }
			    if( bits >= 16  ) { bits >>>= 4; log += 4; }
			    if( bits >= 4   ) { bits >>>= 2; log += 2; }
			    return log + ( bits >>> 1 );
			}
		
		public static boolean next_permutation(int a[])
		   {
			   int i=0,j=0;int index=-1;	   
			   int n=a.length;
			   
			   for(i=0;i<n-1;i++)
				   if(a[i]<a[i+1]) index=i;
			   
			   if(index==-1) return false;
			   i=index;
 
			  
			   for(j=i+1;j<n && a[i]<a[j];j++);
 
			   int temp=a[i];
			   a[i]=a[j-1];
			   a[j-1]=temp;
			   	   
			   for(int p=i+1,q=n-1;p<q;p++,q--)
			   {
				   temp=a[p];
				   a[p]=a[q];
				   a[q]=temp;
			   }
			   
			   return true;
		   }
		   
		   
		public static void division(char ch[],int divisor)
		   {
			   int div=Character.getNumericValue(ch[0]); int mul=10;int remainder=0;
			   StringBuilder quotient=new StringBuilder("");
			   for(int i=1;i<ch.length;i++)
			   {
				   div=div*mul+Character.getNumericValue(ch[i]);	
				   if(div<divisor) {quotient.append("0");continue;}
				   quotient.append(div/divisor);
				   div=div%divisor;mul=10;
				   
			   } 
			   remainder=div;
			   while(quotient.charAt(0)=='0')quotient.deleteCharAt(0);	   
			   System.out.println(quotient+" "+remainder);	  
		   }
		
		public static void sieve(int size)
		{
			sieve=new int[size+1];
			
			primes=new ArrayList<Integer>();
			
			sieve[1]=1;
			
			for(int i=2;i*i<=size;i++)
			{
				if(sieve[i]==0)
				 {
					for(int j=i*i;j<size;j+=i) {sieve[j]=1;}
				 }
			}
			
			for(int i=2;i<=size;i++)
			{
				if(sieve[i]==0) primes.add(i);
			}
		}
		
		public static long pow(long n, long b, long MOD)
		   {
		       long x=1;long y=n; 
		       while(b > 0)
		       {
		           if(b%2 == 1)
		           {
		               x=x*y;
		               if(x>MOD) x=x%(MOD);
		           }
		           y = y*y;
		           if(y>MOD) y=y%(MOD); 
		           b >>= 1;
		       }
		       return x;
		   }
 
 
		public static long mod_inv(long n,long mod)
		{
			return pow(n,mod-2,mod);
		}
		
		//Returns index of highest number less than or equal to key
		 public static int upper(long[] a,int length,long key)
		 {
			    int low = 0;
		        int high = length-1;
		        int ans=-1;
		        
		        while (low <= high) {
		            int mid = (low + high) / 2;
		            if (key >= a[mid]) {
		                ans=mid;
		            	low = mid+1;
		            } else if(a[mid]>key){
		                high = mid - 1;
		            }
		        }
		        return ans;
		}
		
		//Returns index of least number greater than or equal to key
		 public static int lower(long[] a,int length,long key)
		 {
			    int low = 0;
		        int high = length-1;
		        int ans=-1;
		        
		        while (low <= high) {
		            int mid = (low + high) / 2;
		            if (key<=a[mid]) {
		                ans=mid;
		            	high = mid-1;
		            }
		            else{
		            		low=mid+1;
		            	}
		        }
		        return ans;
		} 
		   
		public long gcd(long r,long ans)
		{
			if(r==0) return ans;
			return gcd(ans%r,r);
		}
		public fast() {
			this(System.in);
		}
		public fast(InputStream is) {
			i = is;
		}
		public int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = i.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
		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 String nextString() {
     		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 long nextLong() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
		public int nextInt() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
		public boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
		public boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
 
	}	
}