#include<cstdio>
#include<cstring>
using namespace std;
int t,n,p[10000001],a[10000001],sol,i,j,k;
char s[10000001],c;
int main()
{
    freopen("prefix.in","r",stdin);
    freopen("prefix.out","w",stdout);
    scanf("%d",&t);
    for(i=1;i<=t;i++)
    {
        scanf("%s",&s);
        n=strlen(s);
        for(j=n;j>0;j--)
            s[j]=s[j-1];
        p[1]=0;
        for(j=2;j<=n;j++)
        {
            k=0;
            while(k&&s[k + 1]!=s[j])
                k=p[k];
            if(s[k+1]==s[j])
                k++;
            p[j]=k;
        }
        sol=0;
        for(j=1;j<=n;j++)
            if((j-p[j]==p[j])||(j-p[j]==p[j]-p[p[j]]&&a[p[j]]))
            {
                a[j]=1;
                sol=j;
            }
            else
                a[j]=0;
                printf("%d\n",sol);
    }
    return 0;
}