#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];
		pair<int, int> W = {-0x3f3f3f3f, 0}; int cnt = 0, x = 0; for (int i = 1; i <= n << 1; i++) {
			if (str[i] == '0') continue; cnt++; pair<int, int> tmp = {i - 2 * cnt, cnt};
			W = max(W, tmp); if (tmp.first < W.first) x = max(x, (cnt - W.second) * 2 - (i - (W.first + 2 * W.second)));
		}
		
		int idx = W.second == 0 ? 1 : W.second * 2 + W.first;
		
		for (int i = 1, queue = 0; i <= n; i++) {
			queue += str[(idx + i - 2) % n + 1] == '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 - nxt[n] : n;
		
		printf("%d\n", x + y);
	}
}