#include <bits/stdc++.h>

using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
const int nmax = 1e6 + 5;

int t;
int main()
{
    fin >> t;
    while(t--) {
        string s;
        fin >> s;

        int n = s.size();
        vector <int> pi(n);
        for (int i = 1; i < n; ++i) {
            int j = pi[i - 1];
            while (j > 0 && s[j] != s[i]) {
                j = pi[j - 1];
            }

            if (s[j] == s[i]) {
                j++;
            }

            pi[i] = j;
        }

        int maxi = 0;
        for (int i = n - 1; i > 0; --i) {
            if (pi[i] == 0) continue;

            if ((i + 1) % (i + 1 - pi[i]) == 0) {
                maxi = i + 1;
                break;
            }
        }

        fout << maxi << '\n';
    }
    return 0;
}