#include <bits/stdc++.h>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
char s[1000005];
int n, ct = 0;
void solve()
{
    f >> s;
    n = strlen(s);
    int ps[n + 5] = {0}, ct[n + 5] = {0}, maxx = 0;
    for(int i = 1; i < n; i ++)
    {
        int j = ps[i - 1];
        while(j > 0 && s[i] != s[j])
            j = ps[j - 1];
        if(s[i] == s[j])
            j ++;
        ps[i] = j;
        ct[j] ++;
        if(j != 0 && (i + 1) % j == 0)
            if((i + 1) / j == ct[j] + 1)
            {
                maxx = max(maxx, i + 1);
                int q = 0;
                for(int p = j; p < n; p ++)
                {
                    if(s[p] != s[q])
                        break;
                    q ++;
                    if(q == j)
                    {
                        q = 0;
                        maxx = max(maxx, p + 1);
                    }
                }
            }
    }
    g << maxx << "\n";
}
int main()
{
    int t;
    f >> t;
    while(t --)
        solve();
    return 0;
}