#include<fstream>
#include<algorithm>
#include<cstring>
using namespace std;

int i,j,n,lg[10000001],t,rez=0,nr;
char a[1000001];
void prefix()
{
    int i,k=0;
    lg[1]=0;
    for(i=2;i<=n;++i)
    {
        while(k>0&&a[i]!=a[k+1])
        k=lg[k];
        if(a[i]==a[k+1])
        ++k;
        lg[i]=k;
    }
}
int main()
{
    ifstream f("prefix.in");
    ofstream g("prefix.out");
    f>>t;
    f.get();
    while(t--)
    {
        f.getline(a+1,1000001);
        n=strlen(a+1);
        memset(lg,0,sizeof(lg));
        prefix();
        int ok=0;
        for(i=n;i>=1&&!ok;--i)
        if(lg[i]&&i%(i-lg[i])==0)
        g<<i<<"\n",ok=1;
        if(!ok)
        g<<0<<"\n";
    }
    return 0;
}