//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>
#include <assert.h>

using namespace std;
using ll = long long;

#include <fstream>
//ifstream cin("input.in"); ofstream cout("output.out");
ifstream cin("prefix.in"); ofstream cout("prefix.out");


//VARIABLES

string a, b;
vector<int> pi(1000005);

//FUNCTIONS

void kmp(string s) {
	int n = (int)s.length();
	
	int ans = 1;
	
	for (int i = 1; i < n; ++i) {
		int j = pi[i - 1];
		while (j > 0 && s[i] != s[j]) j = pi[j - 1];
		if (s[i] == s[j]) j++;
		pi[i] = j;

		int lung = i - pi[i] + 1;
		if (pi[i] != 0 && (i  + 1) % lung == 0) {
			ans = max(ans, i + 1);
		}
	}
	if (ans != 1) cout << ans << '\n';
	else cout << 0 << '\n';

}

//MAIN

int main() {

    int t; cin >> t;
    while (t--) {
        string s; cin >> s;
		kmp(s);
    }

    return 0;
}