#include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <numeric>
#include <type_traits>
#include <bitset>
#include <map>
#include <unordered_map>
#include <set>
#include <random>

using namespace std;
using ll = long long;

#define rep(i,n,m) for(ll (i)=(n);(i)<(m);(i)++)
#define rrep(i,n,m) for(ll (i)=(n);(i)>(m);(i)--)
const ll mod = 998244353;
const ll inf = 1e9;
const ll INF = 1e18;

using pll = pair<ll,ll>;

void pline(vector<ll> lis){
    rep(i,0,lis.size()){
        printf ("%d",lis[i]);
        if (i != lis.size()-1) printf(" ");
        else printf("\n");
    }
}

void pline2(vector<ll> lis){
    rep(i,0,lis.size()){
        printf ("%lld",lis[i]);
        if (i != lis.size()-1) printf("\n");
        else printf("\n");
    }
}

void pline(vector<pair<ll,ll>> lis){
    rep(i,0,lis.size()){
        printf ("/%lld,%lld/",lis[i].first,lis[i].second);
        if (i != lis.size()-1) printf(" ");
        else printf("\n");
    }
}

ll opmin(ll l,ll r){
    return min(l,r);
}
ll emin(){
    return INF;
}

ll opmax(ll l,ll r){
    return max(l,r);
}
ll emax(){
    return -INF;
}

ll opsum(ll l,ll r){
    return l+r;
}
ll esum(){
    return 0;
}

int main(){

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

    ll tt;
    cin >> tt;

    rep(lp,0,tt){

        string s;
        cin >> s;

        ll n = s.size();
        
        ll ans = 0;
        rep(i,0,n){
            ans += (i+1) * (n-i);
        }

        //cout << ans << '\n';

        rep(i,0,n){
            
            // first
            if (s[i] == '0'){
                ans += n-i;
            }

            if ( i != n-1 && s[i] == s[i+1] ){
                ans += (i+1) * (n-i-1);
            }

        }

        cout << ans << '\n';

    }
}

/*

? ? ?
 0 0

101

1
 0
  1
10
 01
101


1
  1


*/