#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
using namespace std;
typedef long long int lont;
int main() {
	string S;
	cin >> S;
	int Z = S.size();
	vector<char>veca(Z);
	int icnt = 0;
	for (int ia = 0; ia < Z; ia++) {
		veca.at(ia) = S.at(ia);
	}
	for (int ib = 0; ib < Z; ib++) {
		if (veca.at(ib) == '-') {
			icnt++;
		}
	}
	int X = Z - icnt;
	vector<char>vecb(X);
	int cnt = 0;
	for (int ic = 0; ic < Z; ic++) {
		if (veca.at(ic) != '-') {
			vecb.at(cnt) = veca.at(ic);
			cnt++;
		}
	}
	int ans = 0;
	for (int id = 0; id < X-2; id++) {
		if (vecb.at(id) == 'm' &&
			vecb.at(id + 1) == 'i' &&
			vecb.at(id + 2) == 'n') {
			ans++;
		}
	}
	cout << ans << endl;
}