#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];
void solve()
{
    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;
    }
}
int main()
{
    f>>t;
    while(t--)
    {
        f>>(s+1);
        n=strlen(s+1);
        solve();
        sol=0;
        for(int i=1;i<=n;++i) sol=max(sol,i*((i%(i-ant[i]))==0)*(ant[i]!=0));
        g<<sol<<'\n';
    }
    return 0;
}