#include<bits/stdc++.h>
using namespace std;using ll=long long;const int M=998244353;const double eps=1e-10,inf=1e30;
struct node{int v,l,r;};
struct S
{
	vector<node>arr;string s;
	vector<int>l,r,cov;
	bool chk(int L,int segc)
	{
		if(L%segc)return 0;int B=L/segc;
		for(int j=1;j<segc;j++)if(s.substr(0,B)!=s.substr(B*j,B))return 0;return 1;
	}
	void solve()
	{
		cin>>s;int n=s.length(),res=0;l.resize(n);r.resize(n);cov.resize(n,0);queue<pair<int,int>>Q;
		for(int i=0;i<n;i++){l[i]=(i+n-1)%n,r[i]=(i+1)%n;if(s[i]=='0'&&s[(i+1)%n]=='1')Q.push({i,0});}
		for(;!Q.empty();Q.pop())
		{
			int L=Q.front().first,val=Q.front().second,R=r[L],LL=l[L],RR=r[R];
			res=val;cov[L]=cov[R]=1;if(LL==L)continue;
			r[LL]=RR,l[RR]=LL;if(s[LL]=='0'&&s[RR]=='1')Q.push({LL,val+1});
		}
		int p=0;for(int i=0;i<n;i++)if(!cov[i])p=i;for(int i=p,sw=0;i<p+n;i++)if(cov[i%n])s[i%n]='0'+sw,sw^=1;
		//cout<<res<<"|"<<s<<'\n';
		int lft=n,segc=1;
		for(int i=2;i*i<=lft;i++)if(lft%i==0)
		{
			int L=n;while(chk(L,i))L/=i,segc*=i;
			while(lft%i==0)lft/=i;
		}
		if(chk(n,lft))segc*=lft;
		//cout<<segc<<"|\n";
		cout<<res+n/segc<<'\n';
	}
};
void precal()
{
	
}
int main()
{
	//freopen("1.in","r",stdin);
	cout<<fixed<<setprecision(12);
	ios::sync_with_stdio(0);cin.tie(0);precal();
	int t=1;cin>>t;
	//clock_t a=clock();
	while(t--){S SS;SS.solve();}
	//cout<<"Time:"<<double(clock()-a)<<'\n';
}