//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
string gen(int n,int k)
{
	if(!k)
		return string(n,'0');
	if(k>n/2)
	{
		string ret=gen(n,n-k);
		for(auto &ch:ret)
			ch='1'+'0'-ch;
		return ret;
	}
	string ret=gen(k,n%k);
	string ans;
	for(auto ch:ret)
	{
		ans+='1';
		for(int i=1;i<n/k;i++)
			ans+='0';
		if(ch=='1')
			ans+='0';
	}
	return ans;
}
bitset<1024> bs0,bs1;
bitset<1024> p0[1025],p1[1025];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		string s;
		cin>>s;
		int n=sz(s);
		vector<string> pattern;
		for(int i=0;i<=n;i++)
			pattern.pb(gen(n,i));
		bs0=bs1=0;
		for(int i=0;i<n;i++)
		{
			if(s[i]=='0')
				bs0[i]=1;
			if(s[i]=='1')
				bs1[i]=1;
		}
		for(int i=0;i<=n;i++)
		{
			p0[i]=p1[i]=0;
			for(int j=0;j<n;j++)
				if(pattern[i][j]=='0')
					p0[i][j]=1;
				else
					p1[i][j]=1;
		}
		int ans=0;
		for(int i=0;i<=n;i++)
		{
			int x=n/__gcd(i,n);
			for(int j=0;j<x;j++)
			{
				if((bs0&p0[i])==bs0)
					if((bs1&p1[i])==bs1)
						ans++;
				int x=p0[i][0],y=p1[i][0];
				p0[i]>>=1;
				p1[i]>>=1;
				p0[i][n-1]=x;
				p1[i][n-1]=y;
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}