#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cstdio>
#include <queue>
#include <unordered_map>
#include <set>
#include <cmath>
#include <map>
#include <stack>
#include <sstream>
#include <random>
#include <ctime>
#include <chrono>
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define TIME cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
#define debug(x) cerr << #x << " : " << x << '\n'
#define all(v) v.begin() , v.end()
// std::mt19937 rnd(std::chrono::system_clock::now().time_since_epoch().count());

#define x first
#define y second
#define int long long

using namespace std;

typedef long long LL;
typedef pair<int , int> PII;

const int N = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const int mod = 998244353;

int read(){
    int x = 0 , f = 1;
    char c = getchar();
    while(c < '0' || c > '9'){
        if(c == '-')f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9'){
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x * f;
}

void solve(){
    string s;
    cin >> s;
    int res = 0;
    int n = s.size();
    int cur = n;
    for(int i = 1 ; i <= n ; i ++){
        res += cur * (cur + 1) / 2;
        cur --;
    }
    for(int i = 0 ; i < s.size() ; i ++){
        if(s[i] == '0')res += n - i;
    }
    for(int i = 0 ; i < s.size() - 1 ; i ++){
        if(s[i + 1] == s[i]){
            res += (i + 1) * (n - (i + 1));
        }
    }
    cout << res << endl;
}

signed main(){
    int T;
    cin >> T;
    while(T --){
        solve();
    }
    return 0;
}
/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */