#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
using namespace std;
char c[10005];
int main()
{
    int t,n;
    cin>>t;
    while(t--){
        scanf("%s",c);
        n=strlen(c);
        for(int i=n;i>=1;i--) c[i]=c[i-1];
        int ans=0;
        for(int i=1;i<=n;i++){
            if(c[i]=='y'){
                for(int j=2;i*j*j<=n;j++){
                    if(c[i*j]=='r'&&c[i*j*j]=='x'){
                        ans++;
                    }
                }
            }
            if(c[i]=='x'){
                for(int j=2;i*j*j<=n;j++){
                    if(c[i*j]=='r'&&c[i*j*j]=='y'){
                        ans++;
                    }
                }
            }
        }
        printf("%d\n",ans);
    }
}