#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <array>
#include <queue>
#include <memory.h>
#include <tuple>
#include <set>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <assert.h>
#include <numeric>
#include <ranges>
using namespace std;
using ll=long long;
using ull=unsigned long long;
void solve() {
	string a;
	cin >> a;
	int n = a.size();
	a = '#' + a;
	ll ans = 0;
	ll t = 0 , x = 0;
	int k = 0;
	for(int i = 1 ; i <= n ; ++i) {
		if(a[i] == '1' && k == 0) {
			t += 1;
			x += t;
			k ^= 1;
			continue;
		}
		if(a[i] == '1' && k == 1) {
			t += 2;
			x += t;
			continue;
		}
		if(a[i] == '0' && k == 0) {
			t += 2;
			x += t;
			continue;
		}
		if(a[i] == '0' && k == 1) {
			t += 1;
			x += t;
			k ^= 1;
			continue;
		}
	}
	ans = x;
	for(int i = 1 ; i < n ; ++i) {
		x -= (n - i + 1) * (1 + (a[i] == '0'));
		if(a[i] == a[i + 1]) {
			x -= (n - i);
		}
		if(a[i + 1] == '0') x += n - i;
		ans += x;
	}
	cout << ans << '\n';
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t;
	cin >> t;
	while(t--) solve();
}