#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair < int, int > pii;
typedef vector < int > vi;

const int N = 3e5 + 500;
const int M = 1e6 + 500;
const int LOG = 20;
const int OFF = (1 << 20);
const int INF = 0x3f3f3f3f;
const ll LINF = (ll)1e18;
const int MOD = 1e9 + 7; // 998244353

inline int add(int A, int B) {
    if(A + B >= MOD)
        return A + B - MOD;
    return A + B;
}

inline int sub(int A, int B) {
	if(A - B < 0)
		return A - B + MOD;
	return A - B;
}

inline int mul(int A, int B) {
	return (ll)A * B % MOD;
}

inline int pot(int A, int B) {
	int ret = 1, bs = A;
	for(;B;B >>= 1) {
		if(B & 1) ret = mul(ret, bs);
		bs = mul(bs, bs);
	}
	return bs;
}

int l;
char s[N];

void solve(){
	scanf("%s", s);
	l = strlen(s);
	ll ans = 0;
	int p = 1, n = 0;
	for(int i = 0;i < l;i++) {
		ans += (ll)(n + p) * (l - i);
		if(s[i] == '0') {
			ans += (ll)p * (l - i);
			n += p;
			p = 0;
		} else {
			ans += (ll)n * (l - i);
			p += n;
			n = 0;
		}
		swap(p, n); p++;
	}
	printf("%lld\n", ans);
}

int main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(0);
	//int T = 1;
	int T; scanf("%d", &T);
    for(;T--;) solve();
    return 0;
}