#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define rep(i, a, b) for(int i = a; i < (b); ++i)

#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define ssize(x) int(x.size())

#define pb push_back
#define fi first
#define se second
#define ld long double

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ld, ld> pd;

using LL=long long;

#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "()" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
    o << "{";int i = 0;
    for(auto e : x) o << ", "+!i++<<e;
    return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif

void solve() {
    string s;
    cin >> s;

    ll ile = 0;
    for (int i = 0; i < s.size()-3; i++) {

        if (s[i] == 'a' && s[i+1] == 'n' && s[i+2] == 'i' 
            && s[i+3] == 'a') {
            ile++;

            i = i + 3;
        }

       
    }
    
    cout << ile << '\n';
}


int main() {
    cin.tie(0)->sync_with_stdio(0);

    int z;
    cin >> z;
    while(z--) {
        solve();
    }

}