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

ifstream fin("prefix.in");
ofstream fout("prefix.out");
const int nmax = 1000001;
int m,n,p[nmax],sol,T;
char a[nmax];
void MakePrefix() {
    int i,j,k=0;
    p[1]=0;
    for (i=2;i<=n;i++){
        while (k>0 && a[k+1]!=a[i])
            k=p[k];
        if (a[k+1]==a[i])
            k++;
        p[i]=k;
    }
}
int main()
{
    int i,j,k;
    fin>>T;
    while (T--) {
        fin>>a+1;
        n=strlen(a+1);
        MakePrefix();
        for (i=n;i>=1;i--) {
            if (p[i] && i%(i-p[i])==0) {
                fout<<i<<endl;
                break;
            }
        }
        if (i==0) fout<<0<<endl;
    }
}