#include <cstring>
#include <cstdio>
#include <algorithm>

using namespace std;
typedef long long LL;

const int MAXN = 1e4 + 5;

int t;
char s[MAXN];

void solve() {
    scanf("%s", s + 1);
    int len = strlen(s + 1);
    LL ans = 0;
    for (int i = 1; i <= len; i ++) {
        LL k, l;
        for (int j = 2; ; j ++) {
            k = 1ll * i * j, l = 1ll * k * j;
            if (l > len) break;
            if (s[i] == 'y' && s[k] == 'r' && s[l] == 'x') ++ ans;
            if (s[i] == 'x' && s[k] == 'r' && s[l] == 'y') ++ ans;
        }
    }
    printf("%I64d\n", ans);
}

int main() {
    scanf("%d", &t);
    for (int i = 1; i <= t; i ++) solve();
}