#include<bits/stdc++.h>
using namespace std;
const int N=1e7+5;
int n,m,a[N],b[N],c[N],fail[N];
char s[N];
void solve(){
    scanf("%s",s+1),n=strlen(s+1);
    int cnt0=0;
    for(int i=1;i<=n;i++)cnt0+=s[i]=='0';
    if(cnt0<n-cnt0){
        reverse(s+1,s+n+1);
        for(int i=1;i<=n;i++)s[i]^=1;
    }
    m=1;a[1]=0;
    for(int i=1;i<=n;i++){
        if(s[i]=='1')m++,a[m]=0;
        else a[m]++;
    }
    if(m>1)a[1]+=a[m],m--;
    int pos=1,mx=0;
    for(int i=1,s=0;i<=m;i++){
        s+=a[i]-1;
        if(s>mx)mx=s,pos=i;
    }
    pos=pos%m+1;
    for(int i=1,j=pos;i<=m;i++,j=j%m+1)b[i]=a[j];
    int ans=0;
    for(int i=1,s=0;i<=m;i++){
        s+=b[i]-1;
        ans=max(ans,-s);
        if(s>0)c[i]=s+1,s=0;
        else c[i]=1;
    }
    for(int i=2,j=0;i<=m;i++){
        while(j&&c[j+1]!=c[i])j=fail[j];
        if(s[j+1]==s[i])j++;
        fail[i]=j;
    }
    int k=m-fail[m];
    if(m%k)k=m;
    ans+=n/(m/k);
    printf("%d\n",ans);
}
int main(){
    int T;scanf("%d",&T);
    while(T--)solve();
    return 0;
}