#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <array>
#include <vector>
#include <tuple>
#include <algorithm>
#include <cstdint>

using namespace std;

using vi = vector<int>;
using vb = vector<bool>;
using ll = long long;

ll find_ans(vb v) {
	const int n = v.size();
	ll basic_ans = (ll)n * (n + 1) * (n + 2) / 6;
	ll first_wait_ans = 0;
	for (int i = 0; i < n; ++i)
		if (!v[i])
			first_wait_ans += n - i;
	for (int i = 1; i < n; i += 2)
		v[i] = !v[i];
	ll segments_ans = 0;
	vi sgs(1, 1);
	for (int i = 1; i < n; ++i) {
		if (v[i] != v[i - 1])
			sgs.push_back(0);
		++sgs.back();
	} // 001-
	ll suf_sum = 0;
	ll prev_len = 0;
	for (int i : sgs) {
		suf_sum += prev_len;
		segments_ans += i * suf_sum;
		prev_len += i;
	}
	ll ans = basic_ans + first_wait_ans + segments_ans;
	return ans;
}

bool solve_test() {
	string s;
	if (!(cin >> s))
		return false;
	vb t(s.size());
	for (int i = 0; i < s.size(); ++i)
		t[i] = s[i] == '1';
	cout << find_ans(t) << '\n';
	return true;
}

void solve_tests() {
	int t;
	cin >> t;
	for (int i = 0; i < t; ++i)
		solve_test();
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
#ifdef ONPC
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	solve_tests();
}