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

#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ps push
#define in insert
#define f first
#define s second
#define nl cout<<"\n"
#define ca(v) for(auto i:v) cout<<i<<" ";
#define cbit(x) __builtin_popcount(x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a*b/gcd(a, b))
const int xm[4] = {-1, 1, 0, 0};
const int ym[4] = {0, 0, -1, 1};
const int MOD = 1e9 + 7;
const int MAXN = 5e5 + 5;
const ll POW = 9973;


void solve() {
    string S;cin>>S;
    int n = S.size();
    vector<vector<ll>> dp(n+1,vector<ll>(2,0));
    for(int i=n-1;i>=0;i--) {
        if (S[i]=='0') {
            dp[i][0]=dp[i+1][0] + 2*(n-i);
            dp[i][1]=dp[i+1][0] + 1*(n-i);
        } else {
            dp[i][0]=dp[i+1][1] + 1*(n-i);
            dp[i][1]=dp[i+1][1] + 2*(n-i);
        }
    }
    ll sum = 0;
    for(int i=0;i<n;i++) {
        sum += dp[i][0];
    }
    cout << sum << '\n';
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) {
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }
    int t;cin>>t;
    for(int i=0;i<t;i++) {
        solve();
    }
}