#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template<class T>
bool chmin(T &a, T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

template<class T>
bool chmax(T &a, T b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

void solve(){
    string s; cin >> s;
    int n = s.size();
    vector<vector<ll>> cdp(2,vector<ll>(n+1,0));
    vector<vector<ll>> sdp(2,vector<ll>(n+1,0));
    cdp[0][0] = 1;
    rep(i,0,n){
        cdp[0][i+1]++;
        if (s[i] == '0'){
            cdp[0][i+1] += cdp[0][i];
            sdp[0][i+1] += sdp[0][i] + cdp[0][i] * 2;
            cdp[0][i+1] += cdp[1][i];
            sdp[0][i+1] += sdp[1][i] + cdp[1][i] * 1;
        }
        if (s[i] == '1'){
            cdp[1][i+1] += cdp[0][i];
            sdp[1][i+1] += sdp[0][i] + cdp[0][i] * 1;
            cdp[1][i+1] += cdp[1][i];
            sdp[1][i+1] += sdp[1][i] + cdp[1][i] * 2;
        }
    }
    ll ans = 0;
    rep(i,0,n+1) ans += sdp[0][i]+sdp[1][i];
    cout << ans << endl;
}

int main() {
    int t; cin >> t;
    while (t--) solve();
}