#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[1000005];
int p[1000005],n,i,j,k,m,t;

int main()
{
    freopen("prefix.in","r",stdin);
    freopen("prefix.out","w",stdout);
    scanf("%d\n",&n);
    for (j=1;j<=n;j++)
    {
        gets(s+1);
        m=strlen(s+1);
        t=k=p[1]=0;
        for (i=2;i<=m;i++)
        {
            while (k && s[k+1]!=s[i]) k=p[k];
            if (s[k+1]==s[i]) k++;
            p[i]=k;
        }
        for (i=m;i>=1;i--)
            if (p[i] && i-p[i]!=0 && i%(i-p[i])==0) {t=i;break;}
        printf("%d\n",t);
    }
    return 0;
}