#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define M 310010

 using namespace std;

 char b[M],a[M<<];

 int p[M<<];

 int main()

 {

     int t,maxid,maxl,i,n,id;

     scanf("%d",&t);

     while(t--)

     {

         scanf("%s",b+);

         for(i=;b[i]!='\0';i++)

             if(b[i]<='Z'&&b[i]>='A')

                 b[i]=b[i]-'A'+'a';

         memset(a,,sizeof a);

         n=;

         a[n++]='?';

         a[n++]='#';

         for(i=; b[i]!='\0'; i++)

         {

             a[n++]=b[i];

             a[n++]='#';

         }

         a[n]=;

         maxid=maxl=;

         for(i=; i<n; i++)

         {

             if(maxid>i)p[i]=min(p[*id-i],maxid-i);

             else p[i]=;

             while(a[i+p[i]]==a[i-p[i]])p[i]++;

             if(p[i]+i>maxid)

             {

                 maxid=p[i]+i;

                 id=i;

             }

         }

         for(i=;i<n;i++)p[i]--;

         for(i=;i<n;i+=)

         {

             int cur=p[i];

             cur=cur/*;

             for (;cur>maxl; cur-=)

             {

                 if (p[i+cur/]>=cur/&&p[i-cur/]>=cur/)

                 {

                     maxl=cur;

                     break;

                 }

             }

         }

         printf("%d\n",maxl);

     }

     return ;

 }