#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<vector>
using namespace std;

const char IN[] = {"prefix.in"};
const char OUT[] = {"prefix.out"};
const int INF = 1000000005;
const double PI  = 3.14159265;
const int TMAX = 10;
const int SIRMAX = 1000005;

#define II inline
#define LL long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fs first
#define ss second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) 	for(int i = a ; i <= b ; i++)
#define IFOR(i, a, b) 	for(int i = a ; i >= b ; i--)
#define FORIT(it, V) 	for(vector<int> :: iterator it = V.begin() ; it != V.end() ; it++)
#define all(a) a, a + 

int T, N;
char c[SIRMAX];
int L[SIRMAX];

void citi()
{
	gets(c + 1);
	N = strlen(c + 1);
	while(!('a' <= c[N] && c[N] <= 'z'))	N--;
}

int lung()
{
	int k = 0, REZ = 0;
	FOR(i, 2, N)
	{
		k = L[i - 1];
		while(k && !(c[k + 1] == c[i]))	
			k = L[k];
		if(c[k + 1] == c[i])
			k++;
		L[i] = k;
		if(k && i % (i - k) == 0)	REZ = i;
	}
	return REZ;
}

int main()
{
	freopen(IN, "r", stdin);
	freopen(OUT, "w", stdout);
	
	scanf("%d\n", &T);
	FOR(i, 1, T)
	{
		citi();
		printf("%d\n", lung());
		fill(L, L + N + 1, 0);
	}
	
	return 0;
}