#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#define REP(i,n) for(int i = 0; n > i; i++)
#define MOD 1000000007
using namespace std;
typedef vector<int> Ivec;
typedef pair<int, int> pii;
typedef long long int ll;

int main() {
	char s [101];
	scanf("%s", s);
	int count = 0;
	int state = 0;
	for (int i = 0; strlen(s) > i; i++) {
		if (s[i] == 'm' && s[i + 1] == 'i') {
			i += 2;
			for (; strlen(s) > i; i++) {
				if (s[i] == '-') continue;
				if (s[i] == 'n') {
					count++;
					break;
				}
				else break;
			}
		}
	}
	printf("%d\n", count);
	return 0;
}