#include <bits/stdc++.h>
#define MAXN 1100006  
#define For(I,A,B) for(int I = A; I <= B; ++I)
#define foR(I,A,B) for(int I = A; I >= B; --I)
using namespace std;
typedef long long _ll;

_ll T,n,ans,tmp;
char ss[MAXN],*s = ss-1;
void solve()
{
    cin >> ss; n = strlen(s+1);
    tmp = ans = 0;
    For(i,1,n-1)
    {
        tmp = (i)*(n-i);
        if(s[i] == s[i+1]) tmp <<= 1;
        ans += tmp;
    }
    For(i,1,n)
        ans += (s[i]^48)?(n-i+1):((n-i+1)<<1);
    cout << ans << '\n';
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> T;
    while(T--) solve();
    return 0;
}