//#pragma GCC optimize(3,"Ofast","inline")
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int main(){
    ios::sync_with_stdio(0); cin.tie(0);
	int T=1;
	cin>>T;
	while(T--){
		string s;
		cin>>s;
		ll n=s.size();
		ll ans=0,now=0,cnt=0;
		for(int i=0;i<n;i++){
			if((s[i]-'0')^(cnt&1)){
				cnt++;
				now+=cnt;
				
			}
			else{
				cnt+=2;
				now+=cnt;
				
			}
		}
		ans+=now;
		//cout<<ans<<"\n";
		for(int i=1;i<n;i++){
			if(s[i]==s[i-1]){
				now-=(n-i)*2;
				if(s[i-1]=='1')
					now-=1;
				else
					now-=2;
			}
			else if(s[i]=='0'){
				now-=1;
			}
			else{
				now-=2*(n-i+1);
			}
			
			ans+=now;
			//cout<<ans<<"\n";
		}
		cout<<ans<<"\n";
	}
}
/*

3
101
011
11010
*/