/// Till I Collapse
/*
 *  Hypothesis:
 *
 *  Proof:
 *
 *  Time Complexity:
 *
 *  Memory Complexity:
 *
 */
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 2e5 + 5, LG = 19, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
const int dx[] = {-1, 1, -1, 1};
const int dy[] = {1, -1, -1, 1};

vector<int> adj[N], radj[N];
int lvl[N];
bool vis[N];
vector<int> ord;
vector<int> topo;

void dfs(int node) {
    if (vis[node])
        return;
    vis[node] = true;
    for (auto v: radj[node])
        dfs(v);
    topo.push_back(node);
}

int g;
vector<int> vec;
int cnt[N];
int scc[N];
int cmp;

void dfs2(int node, int d) {
    if (lvl[node]) {
        g = __gcd(g, abs(lvl[node] - d));
        return;
    }
    scc[node] = cmp;
    vec.push_back(node);
    lvl[node] = d;
    for (auto v: adj[node])
        if (!lvl[v] || scc[v] == scc[node])
            dfs2(v, d + 1);
}

void doWork() {
    string s;
    cin >> s;
    int ans = 0;
    f(i, 3, s.size()) {
        if (s.substr(i - 3, 4) == "ania") {
            s[i] = 'x';
            ans += 1;
        }
    }
    cout << ans << '\n';
}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}