#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  string S[2]; cin >> S[0];
  for (auto x: S[0]) {
    if (x=='h') continue;
    else if (x=='e') S[1] += 'h';
    else S[1] += x;
  }
  // debug(S,S+2);

  ll result = 0;
  rep(i,2) {
    if (S[0]==S[1]||S[i]=="") continue;
    vector<ll> count;
    ll l = S[i].size(), now = 0, type = 0, pos = 0;
    while (pos<l) {
      // cout << i << "-" << pos << " " << type << endl;
      if (S[i].substr(pos,2)=="om"&&type==2) { now++; pos+=2; }
      else if (S[i][pos]=='n'&&type==1) { type = 2; pos++; }
      else {
        count.push_back(now); now = 0;
        if (pos+2<=l&&S[i].substr(pos,2)=="ph") { type = 1; pos+=2; }
        else { type = 0; pos++; }
      }
    }
    count.push_back(now);
    // debug(all(count));

    ll tmpr = (*max_element(all(count))) + accumulate(all(count),0) + (i+1);
    result = max(result, tmpr);
  }
  cout << result << endl;
  return 0;
}