#include <bits/stdc++.h>
using namespace std;
ifstream f ("prefix.in");
ofstream g ("prefix.out");
const int nmax=1e6+3;
int ant[nmax],k,n,t,sol;
char s[nmax];
int main()
{
    f>>t;
    while(t--)
    {
        f>>(s+1);
        n=strlen(s+1);
        k=0;
        for(int i=2;i<=n;++i)
        {
            while(k&&s[i]!=s[k+1]) k=ant[k];
            if(s[i]==s[k+1]) ++k;
            ant[i]=k;
        }
        sol=0;
        for(int i=n;i>=1;--i)
        {
            sol=max(sol,i*((i%(i-ant[i]))==0)*(ant[i]!=0));
            if(sol) break;
        }
        g<<sol<<'\n';
    }
    return 0;
}