#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
 
int n;
string s;
long long dp[mxN][2];

ll getsum(int l, int r) {
    return 1LL * (l + r) * (r - l + 1) / 2;
}

void solve()
{
    cin >> s;
    n = sz(s);

    ll res = 0;
    for(int i = 0; i < n; i++) {
        res += getsum(1, n - (i + 1) + 1);
    }

    for(int i = 0; i < n; i++) {
        if(s[i] == '0') res += n - i;
    }

    for(int i = 0; i + 1 < sz(s); i++) {
        if(s[i] != s[i + 1]) continue;
        res += 1LL * (i + 1) * (n - (i + 1));
        // cout << i + 1 << ' ' << n + 1 - (i + 1) <<
    }
    cout << (res) << endl;
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // freopen(TASK".inp" , "r" , stdin);
    // freopen(TASK".out" , "w" , stdout);
 
    int tc = 1;
    cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}