#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#define fi first
#define se second
using namespace std;
int T,a[1100];
string s;
char s1[1100];
priority_queue <pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >pq;
void sol(){
	cin>>s;
	int n=s.size(),sum,dmt,ans=0;
	for(int c1=0;c1<=n;c1++){
		sum=0;dmt=0;
		while(!pq.empty()){
			pq.pop();
		}
		for(int i=0;i<n;i++){
			if(sum+c1<=0){
				s1[i]='0';sum+=c1;
			}
			else{
				s1[i]='1';sum+=c1-n;
			}
			if(s1[i]=='1'&&s[i]=='0') dmt++;
			if(s1[i]=='0'&&s[i]=='1') dmt++;
			a[i]=sum;
			pq.push({a[i],i});
		}
		for(int k=0;k<n;k++){
			int cg=1;
			if(k){
				cg=0;
				if(!pq.empty()&&pq.top().fi==k-n){
					cg=1;
					while(!pq.empty()&&pq.top().fi==k-n){
						int u=pq.top().se;
						pq.pop();
						if(s[u]=='0') dmt--;
						if(s[u+1]=='1') dmt--;
						swap(s1[u],s1[u+1]);
						if(s[u]=='1') dmt++;
						if(s[u+1]=='0') dmt++;
						a[u]+=n;
					}
				}
			}
			if(cg&&dmt==0) ans++;
		}
	}
	cout<<ans<<'\n';
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>T;
	while(T--){
		sol();
	}
	return 0;
}