hdu3746

/**/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <stack>
#include <queue>

typedef long long LL;
using namespace std;

int n;
char s[100005];
int fail[100005];
int len;

void getfail(){
	int x = -1;
	fail[0] = -1;
	for (int i = 1; i < len; i++){
		while(x >= 0 && s[i] != s[x + 1]){
			x = fail[x];
		}
		if(s[i] == s[x + 1]) x++;
		fail[i] = x;
	}
}

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

	scanf("%d", &n);
	while(n--){
		scanf("%s", s);
		len = strlen(s);
		getfail();
		int length = len - 1 - fail[len - 1];
		//for (int i = 0; i < len; i++) printf("%d ", fail[i]);
		//printf("\n");
		if(length != len && len % length == 0){
			printf("0\n");
		}else{
			printf("%d\n", length - (fail[len - 1] + 1) % length);
		}
	}

	return 0;
}
/**/