#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N=1e05+10;
const LL mod=1e09+7;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >t;
priority_queue<LL> q;
int cmp(int a,int b)
{
	return a<b;
}
LL gcd(LL a,LL b) 
{    
    return b > 0 ? gcd(b,a%b):a;
}
LL qpow(LL a , LL b)//快速幂
{
	LL sum=1;
	while(b){
		if(b&1){
			sum=sum*a%mod;
		}
		a=a*a%mod;
		b>>=1;
	}
	return sum;
}
/*struct BIT{//Binary indexed Tree(树状数组)
	int n;
	vector<int> tr;
	BIT(int n) : n(n) , tr(n + 1 , 0){
	}
	int lowbit(int x){
		return x & -x;
	}
	void modify(int x , int modify_number){
		for(int i = x ; i <= n ; i += lowbit(i)){
			tr[i] += modify_number;
		}
	}
	void modify(int l , int r , int modify_number){
		modify(l , modify_number);
		modify(r + 1 , -modify_number);
	}
	int query(int x){
		int res = 0;
		for(int i = x ; i ;  i -= lowbit(i))
			res += tr[i];
		return res;
	}
	int query(int x , int y){
		return query(y) - query(x);
	}
};*/
struct DSU{//Disjoint Set Union(并查集)
	vector<int> fa;
	DSU(int n) : fa(n + 1 , 0){//构造函数，初始化
		iota(fa.begin(),fa.end(),0);//等价于从0到n赋值
	}
	int find(int x){
		return fa[x] == x ? x : fa[x] = find(fa[x]);
	}
	bool merge(int x , int y){
		x = find(x);
		y = find(y);
		if(x == y)
			return false;
		else{
			fa[y] = x;
			return true;
		}
	}
};
struct TRIE{
	int nex[N][26] , id;
	int cnt[N];
	void insert(string s){
		int p = 0 , l = s.size();
		for(int i = 0 ; i < l ; i ++){
			int x = s[i] - 'a';
			if(!nex[p][x])
				nex[p][x] = ++id;
			p = nex[p][x];
		}
		cnt[p]++;
	}
	int find(string s){
		int p = 0 , l = s.size();
		for(int i = 0 ; i < l ; i ++){
			int x = s[i] - 'a';
			if(!nex[p][x])	return 0;
			p = nex[p][x];
		}
		return cnt[p];
	}
};
void solve() 
{
	string s;
	cin>>s;
	int n = s.size();
	LL ans = 0;
	LL basic = 0;
	LL dp[n];
	int cnt0 = 0 , cnt1 = 0;
	for(int i = 0 ; i < n ;  i ++){
		ans = i == 0 ? 0 : dp[i - 1];
		ans += i + 1;
		if(s[i] == '1'){
			ans += cnt1;
			cnt1 += cnt0;
			cnt0 = 0;
			cnt1++;
		}
		else{
			cnt0 ++;
			ans += cnt0;
			cnt0 += cnt1;
			cnt1 = 0;
		}
		dp[i] = ans;
	}
	LL out = 0;
	for(int i = 0; i < n ; i ++){
		out += dp[i];
	}
	cout<<out<<endl;
}            	
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}