#include <cstdio>
#include <cstring>


#define nmax 1000005

using namespace std;

char a [nmax];
int i, k, urm [nmax], kmax, n, T;
inline void solve () {
	
	memset (urm, 0, sizeof (urm));
	for (i = 2, k = 0, kmax = 0; i <= n; i++) {
		while (k && a [k + 1] != a [i])
			k = urm [k];
		if (a [k + 1] == a [i]) ++k;
		urm [i] = k;
		if (k && i % (i - k) == 0) kmax = i;
	}
	printf ("%d\n", kmax);
}	
int main () {

	freopen ("prefix.in", "r", stdin);
	freopen ("prefix.out", "w", stdout);
	for (scanf ("%d\n",&T); T; --T) {
		scanf ("%s\n", a + 1); n = strlen (a + 1);
		solve ();
	}
	return 0;
}