#include <bits/stdc++.h>
using namespace std;

int solve(vector<int> &a){
	int ans=0;
	
	int n=a.size();
	/*
	cerr << "n : " << n << endl;
	for (auto e:a) cerr << e << " ";
	cerr << endl; 
	*/
	vector<pair<int,int>> v;
	
	for (int l=0,r=0;l<n;l=r+1){
		for (r=l;r<n && a[r]==a[l];) r++;
		r--;
		
		if (l==r) continue;
		
		if (a[l]==1){
			v.emplace_back(l,r);		
		}
		else{
			int tmpl=l,tmpr=r;
			for (;!v.empty() && tmpl<tmpr;){
				auto& P=v.back();
				if (P.second-P.first<=tmpr-tmpl){
					ans=max(ans,(tmpl-P.second-1)/2+(P.second-P.first));
					tmpl+=P.second-P.first;
					v.pop_back();
				}
				else{
					ans=max(ans,(tmpl-P.second-1)/2+(tmpr-tmpl));
					P.second-=tmpr-tmpl;
					tmpl=tmpr;
				}
			}
		}
	}
	/*
	for (auto [l,r]:v){
		cerr << "l,r : " << l << " " << r << endl;	
	}
	*/
	int prel=-1,prer=-1;
	for (auto [l,r]:v){
		for (int i=l;i<=r;i++) a[i]=1;
		for (int i=l-1;i>=prer+1;i--) a[i]=(l-1-i)%2;
		prel=l;
		prer=r;
	}
	
	vector<int> nxt(n);
	nxt[0]=-1;
	int k=-1;
	for (int i=1;i<n;i++){
		while (k>-1 && a[k+1]!=a[i]){
			k=nxt[k];
		}
		if (a[k+1]==a[i]) k++;
		nxt[i]=k; 
	}
	int L=n-(nxt[n-1]+1);
	if (n%L==0) ans+=L;
	else ans+=n;
	
	return ans;
}

int main(){
	ios_base::sync_with_stdio(false);
	int Tcase=1;
	cin >> Tcase;
	for (;Tcase--;){
		string str;
		cin >> str;
		
		int n=str.length();
		vector<int> a(n);
		for (int i=0;i<n;i++) a[i]=str[i]-'0';
		
		int cnt=0;
		for (auto x:a){
			if (x==1) cnt++;
			else cnt--;
		}
		if (cnt<0){
			reverse(a.begin(),a.end());
			for (auto &x:a) x=1-x;	
		}
		
		int pos=-1,mn=n+1,sum=0;
		
		for (int i=0;i<n;i++){
			if (a[i]==1) sum++;
			else sum--;
			if (sum<mn){
				mn=sum;
				pos=i;
			}
		}
		
		rotate(a.begin(),a.begin()+pos+1,a.end());
		
		cout << solve(a) << "\n";
		
	}
	return 0;	
}