#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10000005;
char str[MAXN << 1], str2[MAXN]; int dp[MAXN << 1], nxt[MAXN];
int main() {
	int t; scanf("%d", &t); while (t--) {
		scanf("%s", str + 1); int n = strlen(str + 1);
		int m = 0; for (int i = 1; i <= n; i++) m += str[i] == '1';
		if (m > n / 2) {
			reverse(str + 1, str + 1 + n), m = n - m; for (int i = 1; i <= n; i++) str[i] ^= 1;
		}
		for (int i = 1; i <= n; i++) str[i + n] = str[i];
		dp[1] = 0; for (int i = 2; i <= n << 1; i++) dp[i] = max(str[i - 1] == '1' ? dp[i - 1] + 1 : dp[i - 1] - 1, 0);
		int x = 0; for (int i = 1; i <= n << 1; i++) if (str[i] == '1') x = max(x, dp[i]);
		
		int idx = n + 1; while (dp[idx]) idx++;
		for (int i = 1, queue = 0; i <= n; i++) {
			queue += str[(idx + i - 2) % n + 1]; str2[i] = str2[i - 1] != '1' && queue ? '1' : '0';
			queue -= str2[i] == '1';
		}
		
		for (int i = 2; i <= n; i++) {
			nxt[i] = nxt[i - 1]; while (nxt[i] && str2[i] != str2[nxt[i] + 1]) nxt[i] = nxt[nxt[i]];
			if (str2[i] == str2[nxt[i] + 1]) nxt[i]++;
		}
		
		int y = n % (n - nxt[n]) == 0 ? n / (n - nxt[n]) : n;
		
		printf("%d\n", x + y);
	}
}