#include <cstdio>

 #include <algorithm>

 #include <cstring>

 #include <ctype.h>

 #include <cstdlib>

 #include <stack>

 #include <set>

 #include <map>

 #include <queue>

 #include <string>

 #include <cmath>

 using namespace std;

 int T;

 char P[];

 int solve(char *P)

 {

     int m = (int)strlen(P);

     int f[m+];

     memset(f,-,sizeof f);

     int i = ,j = -;

     while(i != m)

     {

         if(j == -||P[i] == P[j])

             f[++i] = ++j;

         else

             j = f[j];

     }

     int k = m-f[m];

     return (k != m && f[m]%k==) ?  : k-f[m]%k;

 }

 int main()

 {

     scanf("%d",&T);

     while(T--)

     {

         scanf("%s",P);

         printf("%d\n",solve(P));

     }

 }