#include <fstream>

using namespace std;

ifstream fin("prefix.in");
ofstream fout("prefix.out");

const int N=1000000+5;

int t;

string s;
int n;
int ps[N];

inline void build_ps()
{
    int i=1;
    int cur=0;
    while(i<n)
    {
        if(s[i]==s[cur])
        {
            cur++;
            ps[i]=cur;
            i++;
        }
        else
        {
            if(cur==0)
            {
                ps[i]=0;
                i++;
            }
            else
            {
                cur=ps[cur-1];
            }
        }
    }
}

int main()
{
    fin>>t;
    for(int tc=1;tc<=t;tc++)
    {
        fin>>s;
        n=s.size();
        build_ps();
        int ans=0;
        for(int i=0;i<n;i++)
        {
            if(ps[i]!=0 && (i+1)%(i+1-ps[i])==0)
            {
                ans=i+1;
            }
        }
        fout<<ans<<"\n";
    }
    return 0;
}