#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;

void solve() {
	string s; cin >> s;
	int n = sz(s);
	ll ans = n * 1ll * (n + 1) * 1ll * (n + 2) / 6;
	for (int i = 1; i < n; i += 2)
		s[i] ^= 1;
	vector<ll> cnt(2);
	for (int i = n - 1, f = 0; i >= 0; i--, f ^= 1) {
		s[i] -= '0';
		cnt[s[i]]++;
		if (i + 1 < n && s[i] != s[i + 1])
			cnt[s[i]] += cnt[!s[i]] + n - i - 1;
//		cout << cnt[0] << " " << cnt[1] << " " << f << endl;
		ans += cnt[f];
	}
	cout << ans << "\n";
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int t; cin >> t; while (t--) solve();
}