#include<bits/stdc++.h>
using namespace std;
int t,n;
int steps[100000+5];
long long houzhui[100000+5];
long long ans;
string s;
int len;
int pos,ti,cnt;
int main()
{
	cin>>t;
	while(t--)
	{
		
	 memset(steps,0,sizeof(steps));
	 memset(houzhui,0,sizeof(houzhui));
	 ans=0;
	 pos=0;
	 ti=0;
	 
		
	cin>>s;
	len=s.length();
    
    while(pos<=len)
    {
    
    	
    	int flag;
    	
    	
    	
    	if(ti%2)flag=1-(s[pos]-'0');
    	else flag=s[pos]-'0';
    	
    	//cout<<"pos="<<pos<<"   ti="<<ti<<"  flag="<<flag<<"  s[pos]="<<s[pos]<<endl;
    	//system("pause");
    	if(flag==1)
    	{
    		pos++;ti++;
			steps[pos]=ti;
    	    if(pos==len)break;
		}
		else 
		ti++;
		
	}
	
	
    
    houzhui[len]=steps[len];
    for(int i=len-1;i>=0;i--)
    {
    	ans+=steps[i+1];
    	houzhui[i]=houzhui[i+1]+steps[i];
	}
	/*
	for(int i=0;i<=len;i++)
	cout<<steps[i]<<" ";
	cout<<endl;
	
    for(int i=0;i<=len;i++)
	cout<<houzhui[i]<<" ";
	cout<<endl;
	
    */
    
    for(int i=1;i<len;i++)
    {
    	int ifchanged;
    	if(steps[i]%2==1)ifchanged=1;
    	else ifchanged=0;
    	
    	if(!ifchanged)
		{
			ans+=houzhui[i+1]-(len-i)*steps[i];
		}
		else 
		{
			if(s[i]=='0')
			{
				ans+=houzhui[i+1]-(len-i)*steps[i];
				ans+=(len-i);
			}
			else
			{
				i++;
				ans+=houzhui[i+1]-(len-i)*steps[i];
				ans+=(len-i+1);
				i--;
				
			}
		}
		
    	
    	
    
		
	}
    cout<<ans<<endl;
    
    }
	return 0;
}