// by Alex Prohnitchi
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const ll mod=1e9+7;
const ll INF=2e9;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define PI 3.14159265358979

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r){return uniform_int_distribution<int>(l,r)(rng);}

ifstream fin("prefix.in");
ofstream fout("prefix.out");

ll t,n;

void solve() {
	string s;
	fin >> s;
	ll n=sz(s);
	ll j=0,pref[n+2];
	pref[1]=0;
	ll ans=0;
	for (ll i=2; i<=n; i++) {
		while (j>0 && s[j]!=s[i-1]) {
			j=pref[j];
		}
		if (s[j]==s[i-1])j++;
		pref[i]=j;
		//cout << "a\n";
		if (j!=0 && pref[i]%(i-pref[i])==0) {
			ans=max(ans,i);
		}
	}
	fout << ans << '\n';
	return;
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	t=1;
	cin >> t;
	while (t--) {
		solve();
	}

}