#include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define FORR(i,l,n) for(int (i)=l;(i)<(int)(n);++(i))

void solve() {
	std::string S;
	std::cin >> S;
	int mi_n= 0;
	int fI = 0;
	while ((fI = S.find("mi",fI) )!= string::npos) {
		int eI = 0;
		while ((eI = S.find('n',fI)) != string::npos) {
			if (eI + 1 < S.length()){
				if (S[eI + 1] != 'n') {
					++mi_n;
					fI = eI;
					break;
				}
				else {
					fI = eI;
					break;
				}
			}
			else if (eI + 1 >= S.length()) {
				++mi_n;
				fI = eI;
				break;
			}
			else {
				fI = eI;
				break;
			}
		}
	}
	cout << mi_n << endl;

}
int main() {
	ios::sync_with_stdio(false);
	solve();
	return 0;
}