#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
using namespace std;
// #define debug(x) cout<<"[debug]"#x<<"="<<x<<endl
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const ld eps=1e-8;
const int INF=0x3f3f3f3f,mod=998244353;
const ll INFF=0x3f3f3f3f3f3f3f3f;

#ifndef ONLINE_JUDGE
#define debug(...)
#include<debug>
#else
#define debug(...)
#endif

const int N=100005;
char s[N];
int a[N];
int n;
ll dp[N][2];
ll f[N][2];
void solve()
{
    scanf("%s",s+1);
    int n=strlen(s+1);
    for(int i=1;i<=n;i++) a[i]=(s[i]-'0'),dp[i][0]=dp[i][1]=0,f[i][0]=f[i][1]=0;
    ll res=0;
    dp[0][1]=1;
    for(int i=1;i<=n;i++)
    {
        dp[i][(a[i]&1)^1]+=dp[i-1][(a[i]&1)^1]+dp[i-1][a[i]&1];
        f[i][(a[i]&1)^1]+=f[i-1][(a[i]&1)^1]+f[i-1][(a[i]&1)]+2*dp[i-1][(a[i]&1)^1]+dp[i-1][a[i]&1];
        res+=f[i][(a[i]&1)^1];
        dp[i][1]+=1;
    }
    printf("%lld\n",res);
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        solve();
    }
}