#include <bits/stdc++.h>
using namespace std;
int n,in,k,phi[1000010],i,lu,ma,pm;
char st[1000010];
int main()
{
    ifstream f ("prefix.in");
    ofstream g ("prefix.out");
    f>>n;
    for(in=1; in<=n; ++in)
    {
        f>>st+1;
        k=0;
        phi[1]=0;
        lu=strlen(st+1);
        ma=0;
        for(i=2; i<=lu; ++i)
        {
            while(k>0&&st[k+1]!=st[i])k=phi[k];
            if(st[i]==st[k+1])++k,phi[i]=k;
            else phi[i]=0;
            if(k>0&&i%(i-k)==0)ma=i;
        }
        g<<ma<<'\n';
    }
    return 0;
}