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

using ll = long long;
const int N = 5e6 + 5, inf = 0x3fffffff, mod = 998244353;
const long long INF = 0x3fffffffffffffff;

int n;
string s;

int main() {
    #ifdef stdjudge
        freopen("/home/stdforces/code/contest/in.txt", "r", stdin);
    #endif

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while(t--) {
        cin >> s;
        n = s.size();

        ll ans = 0;
        vector<vector<ll>> dp(n + 1, vector<ll>(2));
        for(int i = n - 1; i >= 0; i--) {
            ll tot = n - i;
            if(s[i] == '0') {
                dp[i][0] = dp[i + 1][0] + 2 * tot;
                dp[i][1] = dp[i + 1][0] + 1 * tot;
            } else {
                dp[i][0] = dp[i + 1][1] + 1 * tot;
                dp[i][1] = dp[i + 1][1] + 2 * tot;
            }
            ans += dp[i][0];
        } 

        cout << ans << "\n";
    }

    return 0;
}