#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define int long long


void solve(){
	
	int n;
	string s;
	cin >> s;
	n = s.size();
	
	int ans = 0;
	int sum = 0;


	vector<vector<vector<int>>> cnt(n+1, vector<vector<int>>(2, vector<int>(2, 0)));
	for(int j = 1; j <= n; j++){
		
		if(s[j-1] == '1'){
			cnt[j][1][1] = cnt[j-1][0][1] + cnt[j-1][0][0] + 1;
			cnt[j][1][0] = cnt[j-1][1][0] + cnt[j-1][1][1];
		}else{
			cnt[j][0][0] = cnt[j-1][0][1] + cnt[j-1][0][0] + 1;
			cnt[j][0][1] = cnt[j-1][1][0] + cnt[j-1][1][1];
		}
		
		sum += cnt[j][1][1] + cnt[j][0][1];
		sum += 2 * (cnt[j][1][0] + cnt[j][0][0]);
		
		// printf("%d : %d\n", j, sum);
		ans += sum;
	}
	printf("\n");
	
	cout << ans << '\n';
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _;
    cin >> _;
    while(_--) solve();

    return 0;
}