#include <bits/stdc++.h>
#define rep1(i, l, r) for (int i = l; i <= int(r); ++i)
#define rep2(i, l, r) for (int i = l; i >= int(r); --i)
#define cop(i, l, r, a, b) rep1(i, l, r) a[i] = b[i]
#define rep(i, x) for (int i = pnt[x]; i; i = nxt[i])
#define rer(i, l, r, a) rep1(i, l, r) read(a[i])
#define ptc putchar
#define il inline
#define eb emplace_back
#define ef emplace_front
#define mp make_pair
#define fst first
#define snd second
#define sqr(x) ((x) * (x))
#define ls(x) x << 1
#define rs(x) x << 1 | 1
#define rout return 0
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef __int128 bll;
// typedef unsigned __int128 ubll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5 + 10, inf = ~0U >> 2, INF = ~0U >> 1;
const int LOGN = log2(MAXN) + 1;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
namespace stupid_lrc {
	template <typename T> il bool read(T &x) {
		x = 0; bool f = false; char ch;
		while (!isdigit(ch = getchar())) {
			f ^= !(ch ^ '-');
			if (ch == EOF) return false;
		}
		while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch & 15), ch = getchar();
		if (f) x = ~x + 1; return true;
	}
	il int read() {int x; read(x); return x;}

	template <typename T> il bool read(pair <T, T> &x) {return read(x.fst) && read(x.snd);}
	
	template <typename T> il void gmin(T &x, T y) {x = x < y ? x : y;}
	
	template <typename T> il void gmax(T &x, T y) {x = x > y ? x : y;}

	template <typename T, typename ...L>
	il bool read(T &x, L &...y) {return read(x) && read(y...);}

	template <typename T> il T lowbit(const T &x) {return x & -x;}
}
using namespace stupid_lrc;
int n, a[1030], sum[1030]; char s[1030];
vector <int> pos[1030];

il bool check(int x) {
	return s[x] == '?' || s[x] == a[x] + '0';
}

int main() {
	for (int T = read(); T--; ) {
		scanf("%s", s + 1); n = strlen(s + 1);
		int ans = 0, cnt1 = 0, cnt2 = n;
		rep1(i, 1, n) {
			cnt1 += s[i] == '1';
			cnt2 -= s[i] == '0';
		}
		rep1(c, cnt1, cnt2) {
			rep1(i, 0, n) pos[i].clear();
			int q = 0;
			rep1(i, 1, n) {
				sum[i] = sum[i - 1] + c; a[i] = 0;
				if (sum[i] > 0) sum[i] -= n, a[i] = 1;
				q += check(i); pos[sum[i] + n].eb(i);
			}
			rep1(k, 1, n) {
				if (pos[k].size() && q == n) ++ans;
				for (auto v : pos[k]) {
					q -= check(v); q -= check(v + 1);
					a[v] = 0; a[v + 1] = 1;
					q += check(v); q += check(v + 1);
				}
			}
		} printf("%d\n", ans);
	}
	rout;
}