#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	string str;
	cin >> str;
	bool lastFlag = false;
	int ans = 0;
	int d = 0;
	for(int i = 0;i < str.size();i++){
		bool resetFlag = false;
		if(d == 0){
			if(str[i] == 'm'){
				d++;
			}else{
				resetFlag = true;
			}
		}else if(d == 1){
			if(str[i] == 'i'){
				d++;
				lastFlag = true;
			}else{
				resetFlag = true;
			}
		}else if(lastFlag){
			if(str[i] == 'n'){
				ans++;
				resetFlag = true;
			}else if(str[i] != '-'){
				resetFlag = true;
			}
		}

		if(resetFlag) d = 0;
	}

	cout << ans << endl;
	return 0;
}