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

void prefix()
{
    int i;j=k=p[k]=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;
        if (p[i] && i-p[i]!=0 && i%(i-p[i])==0) j=i;
    }
}

int main()
{
    freopen("prefix.in","r",stdin);
    freopen("prefix.out","w",stdout);
    scanf("%d\n",&n);
    for (i=1;i<=n;i++)
    {
        gets(s+1);
        m=strlen(s+1);
        prefix();
        printf("%d\n",j);
    }
    return 0;
}