// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define NUM1 1000000007LL
#define all(a) a.begin(), a.end()
#define beg(a) a.begin(), a.begin()
#define sq(a) ((a)*(a))
#define NUM2 998244353LL
#define MOD NUM1
#define fi first
#define se second
typedef long double ld;
const ll MAX = 73;
const ll INF = LLONG_MAX/10;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ld eps = 1e-9;

void solve()
{
    string s;
    cin >> s;
    ll n = s.size();
    vector<vector<ll>> sums(n + 1, vector<ll>(2));
    ll ans = 0;
    for(ll i = n - 1; i >= 0; i--){
        if(s[i] == '1'){
            sums[i][0] = (n - i - 1) + sums[i + 1][1] + 1;
            sums[i][1] = 2*(n - i - 1) + sums[i + 1][1] + 2;
        }
        else{
            sums[i][1] = (n - i - 1) + sums[i + 1][0] + 1;
            sums[i][0] = 2*(n - i - 1) + sums[i + 1][0] + 2;
        }
        // cerr << sums[i][0] << '\n';
        ans += sums[i][0];
    }
    cout << ans << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	ll t = 1;
	cin >> t;
	while(t--) solve();
    return 0;
}