#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()
{
    freopen("prefix.in","r",stdin);
    freopen("prefix.out","w",stdout);
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s",a+1);
        n=strlen(a+1);
        memset(lg,0,sizeof(lg));
        prefix();
       rez=0;
        for(i=1;i<=n/2+1;++i)
        {
            nr=1;
            j=i+i;
            while(lg[j]==i*nr&&j<=n)
            {
            ++nr;
            j+=i;
            rez=max(rez,i*nr);
            }
        }
        printf("%d\n",rez);
    }
    return 0;
}