#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define ll long long
#define wln putchar('\n')
template<class T1,class T2> void chkmin(T1 &x,T2 y){if(y<x)x=y;}
template<class T1,class T2> void chkmax(T1 &x,T2 y){if(y>x)x=y;}
#define maxn 100005
#define mod 256

int T;
int n;
char s[maxn];
int op[maxn];
int tim[maxn];
ll sm[maxn];

void init()
{
    For(i, 1, n) op[i] = tim[i] = sm[i] = 0;
}
void Main()
{
    scanf("%s", s + 1);
    n = strlen(s + 1);
    For(i, 1, n) op[i] = (s[i] - '0') ^ 1;
    For(nw, 1, n) {
        if(tim[nw - 1] % 2 == op[nw]) tim[nw] = tim[nw - 1] + 1;
        else tim[nw] = tim[nw - 1] + 2;
    }
    For(i, 1, n) sm[i] = sm[i - 1] + tim[i];
    ll ans = sm[n];
    For(i, 1, n - 1) {
        if(tim[i] % 2 == 0) {
            ans = ans + sm[n] - sm[i] - 1ll * (n - i) * tim[i];
        }
        else {
            if(op[i + 1] % 2 == 0) {
                ans = ans + sm[n] - sm[i] - 1ll * (n - i) * tim[i] - (n - i);
            }
            else {
                ans = ans + sm[n] - sm[i] - 1ll * (n - i) * tim[i] + (n - i);
            }
        }
    }
    printf("%lld\n", ans);
}
int main()
{
    scanf("%d", &T);
    while(T--) Main();
    return 0;
}
/*
3
101
011
11010

*/