#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>

using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;

template<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}
template<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}

#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()

/* do your best */
pair<string, int> op1(const string &s) {
  // phenom を penh に置換
  string t = "";
  int cnt = 0;

  for(int i = 0; i < s.size(); i++) {
    if(i + 5 <= s.size() and s.substr(i, 5) == "phnom") {
      i += 4;
      t += "penh";
      cnt++;
    } else {
      t += s[i];
    }
  }
  return {t, cnt};
}

pair<string, int> op2(const string &s) {
  // h を消して e -> h に置換
  string t = "";
  int cnt = 0;

  //  h を消す
  for(int i = 0; i < s.size(); i++) {
    if(s[i] == 'h') {
      cnt = 1;
      continue;
    }
    t += s[i];
  }

  // e -> h
  for(int i = 0; i < t.size(); i++) {
    if(t[i] == 'e') {
      t[i] = 'h';
      cnt = 1;
    }
  }

  return {t, cnt};
}

int main() {

  string s; cin >> s;
  for(int i = 0; i < 100; i++) s += 'x';

  int ans = 0;
  // op1 ができない時，op2 をやってみる
  {
    string t1;
    int cnt1;
    tie(t1, cnt1) = op1(s);
    string t2;
    int cnt2;
    tie(t2, cnt2) = op2(s);

    if(s == t1) {
      s = t2;
      ans += cnt2;
    }
  }

  vector<int> a;
  for(int i = 0; i < s.size(); i++) {
    if(s.substr(i, 5) == "xxxxx") break;
    if(s.substr(i, 5) != "phnom") continue;
    
    int cnt = 0;
    int id = i + 3;
    while(1) {
      if(s.substr(id, 2) == "om") {
        cnt++;
        id += 2;
      } else {
        break;
      }
    }

    a.push_back(cnt);
    i = id - 1;
  }
  
  if(a.size() != 0) {
    ans += 1 + accumulate(ALL(a), 0) + *max_element(ALL(a));
  }
  cout << ans << endl;
  return 0;
}