#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
#define all(x) begin(x),end(x)

void solve(){
    string a;
    cin>>a;
    int n=a.size();
    int counter=0;
    for(int i=0;i<n-4;i++){
	if(a[i]=='a'&&a[i+1]=='n'&&a[i+2]=='i'&&a[i+3]=='a'){
	    a[i+3]='z';
	    counter++;
	}
    }
    cout<<counter<<'\n';
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	cin>>tt;
	while(tt--){
		solve();
	}
}