#include<iostream>
#include<bits/stdc++.h>
#include<queue>
#include<cmath>
#include<cstring>
#include<algorithm>
#define e exp(1)
#define fi first
#define se second
using namespace std;
#define pii pair<ll,ll>
#define ll long long
#define FR(i,j,k) for(int i=j;i<=k;i++)
#define Fl(i,j,k) for(int i=j;i>=k;i--)
#define me(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
priority_queue < ll, vector<ll>, greater<ll> > qq;
priority_queue < ll, vector<ll>, less<ll> > pq;
struct node {
	int x, y, ans;
	inline bool operator > (const node &a )const {
		return x > a.x;
	}
} kk;
const ll md = 1e9 + 7;
double pi = acos(-1.0);
const ll N = 2e7 + 10;
const ll M = 1e7 + 10;
const double eps = 1e-6;

ll ksm(ll a, ll b) {
	ll r = 1;
	while (b) {
		if (b & 1)r = r * a % md;
		a = a * a % md;
		b /= 2;
	}
	return r;
}
ll exgcd(ll a, ll b, ll &x, ll &y) {
	if (!b) {
		x = 1, y = 0;
		return a;
	}
	ll d = exgcd(b, a % b, y, x);
	y -= a / b * x;
	return d;
}

ll n, m, l, r, k = 0;

string s;

ll a[N];

inline void solve() {
	cin>>s;
	n=s.size();
	ll ans=0,sum=0;
	for(int i=1;i<=n;i++){
		if(i==1){
			if(s[i-1]=='1'){
				a[1]=1;
			}else a[1]=2;
		}else {
			if(s[i-1]==s[i-2]){
				a[i]=a[i-1]+2;
			}else a[i]=a[i-1]+1;
		}sum+=a[i];
	}
	//cout<<sum<<" ";	
	ans=sum;
	for(int i=2;i<=n;i++){
		if(s[i-2]=='0'){
			sum-=2;
			sum-=(2*(n-i+1));
			ans+=sum;
		}else {
			if(s[i-1]=='0'){
				sum-=1;
				ans+=sum;				
			}else {
				sum-=1;
				sum-=(2*(n-i+1));
				ans+=sum;			
			}
		}
	}cout<<ans<<"\n";
}


int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	int __ = 1;
	cin >> __;
	while (__--) {
		solve();
	}
}