#include<bits/stdc++.h>
using namespace std;
ifstream F("prefix.in");
ofstream G("prefix.out");
char s[1000001];
int n,k,p[1000001],i,d,t;
int main()
{
	F>>t,F.get();
	while(t--) {
		F>>(s+1),k=p[1]=d=0,n=strlen(s+1);
      	for(i=2;i<=n;++i) {
		  	for(;k&&s[k+1]!=s[i];k=p[k]);
            if(s[k+1]==s[i])
                ++k;
            p[i]=k;
      	}
      	for(i=n;i>1&&!d;--i)
            if(p[i]&&i==(i-p[i])*(i/(i-p[i])))
                d=i;
      	G<<d<<"\n";
	}
	return 0;
}