#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3f
const long long N=205;
const long long mod=1e9;
const double PI=acos(-1.0);
typedef long long ll;

int main() {
    int t;
    cin>>t;
    while (t--) {
        string s;
        cin>>s;
        int sum=0;
        for (int i=2; i<=100; i++) {
            for (int j=1; j<=s.length(); j++) {
                if (j*i*i>s.length()) {
                    break;
                }
                if (s[j-1]=='y'&&s[j*i-1]=='r'&&s[j*i*i-1]=='x') {
                    sum++;
                }
                if (s[j-1]=='x'&&s[j*i-1]=='r'&&s[j*i*i-1]=='y') {
                    sum++;
                }
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}