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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define F first
#define S second
#define nl "\n"
#define maxn 1000005
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef pair<int,int> pii;

char s[maxn];
ll len,t1[maxn];

void solve() {
	string ssss;
	cin >> ssss;
	rep(i, 0, sz(ssss)) s[i+1] = ssss[i];
	// cin>>(s+1);
	len=strlen(s+1);
	ll ans=0;
	for(int i=1;i<=len;i++)
	{
		ll L=i,R=len-L+1;
		if(s[i]!=s[i-1]||i==1)
		{
			ans+=(L-1)*R;
			if(s[i]=='1') ans+=R;
			else ans+=2*R;
		}
		else 
		{
			ans+=2*(L-1)*R;
			if(s[i]=='1') ans+=R;
			else ans+=2*R;
		}
	}
	printf("%lld\n",ans);
}

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