#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);

  string S;
  cin >> S;

  int state = 0;

  int ret = 0;
  rep(i,S.length()){
    if(S[i] == 'm') state = 1;
    if(S[i] == 'i'){
      if(state == 1) state = 2;
      else state = 0;
    }
    if(S[i] == '-'){
      if(state == 2 || state == 3) state = 3;
      else state = 0;
    }
    if(S[i] == 'n'){
      if(state == 2 || state == 3){
        ret++;
        state = 0;
      }else{
        state = 0;
      }
    }
  }
  cout << ret << endl;
  
  return 0;
}