#include<bits/stdc++.h>
using namespace std;

using ll = long long;
const int N = 1e5 + 5;

int n;
ll dp[N][2];
string s;

void solve() {
	cin >> s;
	n = (int)s.size();

	dp[n][0] = dp[n][1] = 0;
	for(int i = n - 1; i >= 0; i--) {
		ll tot = n - i;
		if(s[i] == '0') {
			dp[i][0] = dp[i + 1][0] + 2 * tot;
			dp[i][1] = dp[i + 1][0] + 1 * tot;
		} else {
			dp[i][0] = dp[i + 1][1] + 1 * tot;
			dp[i][1] = dp[i + 1][1] + 2 * tot;
		}
	}

	ll ans = 0;
	for(int i = 0; i < n; i++) {
		ans += dp[i][0];
	}

	cout << ans << "\n";
}

signed main()
{
	ios::sync_with_stdio(false),cin.tie(0);

	int t;
	cin >> t;
	while(t--)solve();
}