#include <bits/stdc++.h>

using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
const int lim = 2e6 + 5;
int n, m, lps[lim], v[1005], t,w;
char a[lim] ,b[lim];
void precalc()
{
    int k = 0;
    for (int i = 2; i <= n ; ++i)
    {
        while (k && a[k] != a[i - 1]) k = lps[k];
        if (a[k] == a[i - 1]) k++;
        lps[i] = k;
        if(!i%(i-lps[i]))
          w=max(w,i-lps[i]);
    }
}
int main()
{fin>>t;
for(int i=1;i<=t;++i)
   {fin >> a;
    n = strlen(a);
    w=0;
    precalc();
    fout<<w<<'\n';
   }
    return 0;
}