#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>

#define NMAX 1000002

using namespace std;

char s[NMAX];

void solve()
{
	scanf("%s", &s);

	int maxLen = 0;

	for (int i = 0; s[i] != NULL; ++i)
	{
		int x = 1 + 1; // test to see if just walking the string goes out of time
	}
	

	printf("%d\n", maxLen);
}

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

	int t;
	scanf("%d", &t);
	
	for (int i = 0; i < t; ++i)
		solve();


	

	return 0;
}