#include <bits/stdc++.h>

using namespace std;

const int Nmax = 1e6+6;
int T, pi[Nmax];
char a[Nmax];

void solve()
{
    int i, n, k;
    scanf("%s\n", a+1);
    n = strlen(a+1);

    pi[1] = k = 0;
    for(i=2; i<=n; ++i)
    {
        while(k && a[k+1] != a[i])
            k = pi[k];

        if(a[k+1] == a[i]) ++k;
        pi[i] = k;
    }

    for(i=n; i; --i)
        if(pi[i]!=0 && pi[i] % (i-pi[i]) == 0)
            break;

    printf("%d\n", i);
    for(i=1; i<=n; ++i) a[i] = 0;
}

int main()
{
    freopen("prefix.in", "r", stdin);
    freopen("prefix.out", "w", stdout);

    scanf("%d\n", &T);
    while(T--) solve();

    return 0;
}