#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
#include <map>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int MaxN = 10000;

int T;
char s[MaxN + 5];

int main()
{
    scanf("%d", &T);
    while(T--)
    {
        scanf("%s", s + 1);
        int len = strlen(s + 1);
        int p = sqrt(len);
        int ans = 0;
        for(int i = 2; i <= p; i++)
            for(int j = 1; j <= len / (i * i); j++)
            {
                int a = j, b = j * i, c = b * i;
                bool flag = 0;
                if(s[a] == 'y' && s[b] == 'r' && s[c] == 'x') flag = 1;
                if(s[c] == 'y' && s[b] == 'r' && s[a] == 'x') flag = 1;
                if(flag) ans++;
            }
        printf("%d\n", ans);
    }
}