#include<bits/stdc++.h>
using namespace std;

ifstream f("prefix.in");
ofstream g("prefix.out");

char s[1000002];
int v[1000002],t;

int main()
{
    int l,n,i,raspuns;
    f>>t;
    for(l=1;l<=t;l++)
    {
        f>>(s+1);
        n=strlen(s+1);
        int k=0;
        raspuns=0;
        v[1]=0;
        for(i=2;i<=n;i++)
        {
            while(s[i]!=s[k+1] && k>0)
            {
                k=v[k];
            }
            if(s[i]==s[k+1])
                k++;
            v[i]=k;
        }
        for(i=1;i<=n;i++)
        {
            if(v[i]>0 &&  i % (i-v[i])==0)
                raspuns=max(raspuns,i);
        }
        g<<raspuns<<'\n';
    }
    return 0;
}