#include "bits/stdc++.h"
 
using namespace std;

template<typename _T> void _debug(const char *s, _T x){ cerr << s << " = " << x << "\n";}
template<typename _T, typename... R> void _debug(const char *s, _T x, R... r){ while(*s != ',') cerr << *s++; cerr << " = " << x << ", "; _debug(s + 1, r...);}
 
#define debug(...)  _debug(#__VA_ARGS__,  __VA_ARGS__)
 
#define sz(s)   int32_t(s.size())
#define all(x)  begin(x), end(x)
#define getuniqe(x) x.erase(unique(all(x)), end(x))
#define X first
#define Y second
 
using ll = long long;
using ld = long double;

#define int ll

const int N = 2e5 + 5;

const string ania = "ania";
const string aniania = "aniania";
// anianianianianianiania

void solve() {
    string s;   cin >> s;
    int n = sz(s), m = sz(ania), k = sz(aniania);
    int result = 0;
    for (int i = 0; i < n; i++) {
        bool is_ania = true;
        for (int j = 0; j < m; j++) {
            if (i + j >= n) is_ania = false;    
            else is_ania &= (ania[j] == s[i + j]);
        }
        bool is_ania_ania = (i + k - 1 < n) && is_ania;
        for (int j = 0; j < k; j++) {
            if (i + j >= n) is_ania_ania = false;
            else is_ania_ania &= (aniania[j] == s[i + j]);
        }
        if (is_ania_ania) {
            result++;
            i += k - 2;
        } else if (is_ania) {
            result++;
            i += m - 1;
        }
    }
    cout << result << "\n";
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int tests = 1;  cin >> tests;
    for (int test_case = 1; test_case <= tests; test_case++) {
        solve();
    }
}