#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e5+5,inf=1e9;
int dp[maxn][2];
void solve()
{
    string s;
    cin>>s;
    int n=s.size();
    fill_n(*dp,(n+5)*2,0);
    int ans=0;
    for(int i=1; i<=n; i++)
    {
        ans+=(i+1)*i/2;
        dp[i][1]++;
        if(s[i-1]=='0')
        {
            ans+=dp[i][1]*(n-i+1);
            dp[i+1][1]=dp[i][0]+dp[i][1];
        }
        else
        {
            ans+=dp[i][0]*(n-i+1);
            dp[i+1][0]=dp[i][1]+dp[i][0];
        }
    }
    cout<<ans<<"\n";
}
signed main()
{
//    freopen("in.txt","r",stdin);
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}