#include<bits/stdc++.h>
#define inl inline
using namespace std;
const int N=1e7+5,P=998244353,IB=1<<21; char IN[IB],*IS=IN+IB,*IT=IS;
#define getchar() (IS==IT&&(fread(IS=IN,1,IB,stdin)),*IS++)
struct B {int l,r,t; }b[N];
int T,n,an,bc,a[N*2],ca[2],ne[N*2];
inl int Read()
{
	int s=0; char c; while(!isdigit(c=getchar()));
	for(;isdigit(c);c=getchar()) s=s*10+c-'0'; return s;
}
inl void Reas()
{
	char c; while(!isdigit(c=getchar()));
	for(n=0;isdigit(c);a[++n]=c-'0',c=getchar());
}
int main()
{
	for(int T=Read();T--;printf("%d\n",an))
	{
		Reas(); int t=1; for(a[n+1]=!a[1];a[t]==a[1];++t);
		if(t>n) {an=1; continue; } rotate(a+1,a+t,a+n+1); ca[0]=ca[1]=1;
		for(int l=1,r;l<=n;ca[a[l]]+=r-l,l=r+1) for(r=l;r<n&&(a[r+1]==a[l]);++r);
		if(ca[1]<ca[0]) {reverse(a+1,a+n+1); for(int i=1;i<=n;++i) a[i]=!a[i]; }
		t=0; for(int i=1,j=0,k=0;i<=n;++i) (j+=a[i]?1:-1)<k&&(k=j,t=i);
		rotate(a+1,a+t+1,a+n+1); bc=an=0;
		for(int l=1,r;l<=n;l=r+1)
		{
			for(r=l;r<n&&(a[r+1]==a[l]);++r); if(l==r) continue;
			if(a[l]==1) {b[++bc]={l,r,0}; continue; }
			int tl=l,tr=r,t=0; while(tl<tr)
			{
assert(bc);
				int &bl=b[bc].l,&br=b[bc].r,&bt=b[bc].t,d;
				t<bt?(tl-=bt-t,tr-=bt-t,t=bt):(bl+=t-bt,br+=t-bt,bt=t);
assert(br<tl);
				d=(tl-br)/2; tl-=d; tr-=d; t+=d; bl+=d; br+=d; bt+=d;
				d=min(tr-tl,br-bl); tr-=d; t+=d; bl+=d; bt+=d; bl==br&&(--bc);
			}
			an=max(an,t);
		}
		t=n; fill(a+1,a+n+1,0); for(int i=1;i<=bc;++i)
		{
			int d=an-b[i].t,l=b[i].l+d,r=b[i].r+d; l>n&&(l-=n); r>n&&(r-=n);
			t=min(t,l); a[l]=1; for(int j=r;j>l;!(--j)&&(j=n)) a[j]=1;
		}
		for(int i=t-1,j=1;i;a[i--]=j^=1); for(int i=2;i<=n;++i) !a[i-1]&&(a[i]=1);
		for(int i=1;i<=n;++i) a[n+i]=a[i];
		for(int i=2,j=0;i<=n*2;ne[i]=j+=a[i]==a[j+1],++i) for(;j&&a[i]!=a[j+1];j=ne[j]);
		an+=n*2-ne[n*2];
	}
	return 0;
}