#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long

using namespace std;

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

const int N=1e6+7;
char s[N];
int f[N],n,g[N];
ll ans;
void solve()
{
    scanf("%s",s+1);
    n = strlen(s+1);ans = 0;
    for(int i = 1;i <= n;i ++) {
        f[i] = (s[i] == 'c' || s[i] == '?') + f[i-1];
    }
    for(int i = 1;i <= n;i ++) {
        if(s[i] == 'c') continue;
        int o1 = 0,o2 = 0;
        for(int j = 20;j >= 0;j --) {
            if(i-o1-g[j]-1 < 0) continue;
            if(f[i-1] - f[i-o1-g[j]-1] == i-1 - (i-o1-g[j]-1)) o1 += g[j];
     //       printf("%d %d %d\n",i,j,o1);
        }
        for(int j = 20;j >= 0;j --) {
            if(i+o2+g[j] > n) continue;
            if(f[i+o2+g[j]] - f[i] == o2+g[j]) o2 += g[j];
     //       printf("%d %d %d\n",i,j,o2);
        }
        ans += min(o1/2,o2);
    }
    printf("%lld\n",ans);
}

int main()
{
    //freopen("in.in","r",stdin);
    g[0] = 1;
    for(int i = 1;i <= 20;i ++) g[i] = g[i-1] * 2;
    int T = read();
    while(T --) solve();
}