#include<bits/stdc++.h>
using namespace std;
#define int long long


const int N = 100005;
int dp[N][2];
void solve() {
    int n;
    string s;
    cin>>s;
    n = s.size();
    for(int i=0;i<=n;i++) {
        dp[i][0] = dp[i][1] = 0;
    }
    for(int i=n-1;i>=0;i--){
        if( s[i] == '1' ){
            dp[i][0] = dp[i+1][1] + 1*(n-i);
            dp[i][1] = dp[i+1][1] + 2*(n-i);
        }else{
            dp[i][0] = dp[i+1][0] + 2*(n-i);
            dp[i][1] = dp[i+1][0] + 1*(n-i);
        }
    }
    // for(int i=0;i<n;i++) cout<<dp[i][0]<<" "; cout<<endl;
    // for(int i=0;i<n;i++) cout<<dp[i][1]<<" "; cout<<endl;
    int res = 0;
    for(int i=0;i<n;i++) res+=dp[i][0];
    cout<<res<<'\n';
    
}
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t; cin >> t;
    while(t--) {
        solve();
    }
}
/*
3
101
011
11010
*/