#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <ctime>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define calm (l+r)>>1
const int INF = 2139062143;

const int maxn=10010;
char s[maxn];
int main(){
    //freopen("D://input.txt","r",stdin);
    int T;scanf("%d",&T);
    while(T--){
        scanf("%s",s+1);
        int len=strlen(s+1);
        int ans=0;
        for(int i=1;s[i];i++){
            if(s[i]=='y'){
                for(int j=2;i*j*j<=len;j++){
                    if(s[i*j]=='r'&&s[i*j*j]=='x'){ans++;}
                }
                for(int j=2;i/j/j>0;j++){
                    if(i%(j*j)==0&&s[i/j]=='r'&&s[i/(j*j)]=='x'){
                        ans++;
                    }
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}