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

#define all(V) V.begin (), V.end ()

using LL = long long;

void solve (int tc) {
	string s;
	cin >> s;
	LL n = s.size ();
	vector <LL> pref (n + 1), pref_of_pref (n + 1);
	LL move = 0;
	for (LL i = 0; i < n; i++) {
		if (i == 0) {
			if (s[i] == '0') move += 2;
			else move++;
		} else {
			if (s[i] == s[i - 1]) move += 2;
			else move ++;
		}
		pref[i + 1] = move;
	}
	for (LL i = 1; i <= n; i++) pref_of_pref[i] = pref_of_pref[i - 1] + pref[i];
	// for (LL i = 1; i <= n; i++) cerr << pref_of_pref[i] << " \n"[i == n];

	LL ans = 0, extra = 0, prev = 0;
	for (LL i = 1; i <= n; i++) {
		if (i == 1) ans += pref_of_pref[n];
		else {
			if (s[i - 1] == s[i - 2]) extra++;
			else extra = 0;
			ans += pref_of_pref[n] - pref_of_pref[i - 1] - (pref[i - 1] + extra) * (n - i + 1) + (n - i + 1) * (s[i - 1] == '0');
		}
	}
	cout << ans << '\n';
} 

int main () {
	cin.tie (nullptr) -> ios_base :: sync_with_stdio (false);

	int tests;
	cin >> tests;
	for (int tc = 1; tc <= tests; tc++) {
		solve (tc);
	}

	return 0;
}