#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
typedef long long ll;
const int mod = 1000000007;
const int inf = 2147483647;
const int N = 200020;
char c[N], ch[N];
ll sum[N][2], dp[N][2];
void solve() {
	cin >> c;
	int n = strlen(c);
	for (int i = 1; i <= n; i++) {
		ch[i] = c[i - 1];
	}
	ll ans = 0;
	for (int i = 0; i <= n + 1; i++) {
		sum[i][0] = dp[i][0] = sum[i][1] = dp[i][1] = 0;
	}
	dp[1][0] = 1, dp[1][1] = 0;
	sum[1][0] = 0, sum[1][1] = 0;
	for (int i = 1; i <= n; i++) {
		if (ch[i] == '0') {
			dp[i + 1][0] = dp[i][0] + dp[i][1] + 1;
			dp[i + 1][1] = 0;
			sum[i + 1][0] = 2 * dp[i][0] + dp[i][1] + sum[i][0] + sum[i][1];
			sum[i + 1][1] = 0;
		} else {
			dp[i + 1][1] = dp[i][0] + dp[i][1];
			dp[i + 1][0] = 1;
			sum[i + 1][1] = 2 * dp[i][1] + dp[i][0] + sum[i][0] + sum[i][1];
			sum[i + 1][0] = 0;
		}
		ans += sum[i + 1][1] + sum[i + 1][0];
	}
	cout << ans << endl;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}