#include<fstream.h>
#define N 10000000
char s[N],w[N];
long n,k,p[N],i,t,j,q,r[N],max,l,d,v[N],u,o,h;
int main()
{ifstream f("prefix.in");
ofstream g("prefix.out");
f>>t;
while(t--)
      {f>>s;
      k=q=l=p[1]=r[1]=u=max=j=o=h=0;
      n=strlen(s);
      for(i=2;i<n;i++)
            {while(k>0&&s[k+1]!=s[i])
                    k=p[k];
            if(s[k+1]==s[i])
                    k++;
            p[i]=k;
            if(p[i]>max)
                    {max=p[i];
                    h=i;
                    j=i-max;}}
      o=h;
      for(i=0;i<j;i++)
            w[i]=s[i];
      for(i=2;i<j;i++)
            {while(q>0&&w[q+1]!=w[i])
                    q=r[q];
            if(w[q+1]==w[i])
                    q++;
            r[i]=q;}
      for(i=1;i<n;i++)
            {while(l>0&&w[l+1]!=s[i])
                    l=r[l];
            if(w[l+1]==s[i])
                    l++;
            if(l==j-1&&w[0]==s[i-l])
                    v[++u]=i-j+1;}
      if(u==1)
            if(max+1<j)
                    d=max+1;
            else
                    d=j;
      else
            if(u==0)
                    if(o>0)
                               d=o+1;
                    else
                               d=0;
            else         
                    d=v[1]+j;
      for(i=2;i<=u;i++)
      if(v[i]-v[i-1]==j)
            d=v[i]+j;
      else
            break;
      g<<d<<"\n";}
f.close();
g.close();
return 0;}