#include using namespace std; #pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,1,-1,0,1,1,-1,-1,0}; const ll dx[9]={1,0,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } string nf="monhp"; string t="nhep"; ll ans=0; ll solve(string s){ rev(all(s)); ll cnt=0; while(1){ if(s.size()>=5&&s.substr(s.size()-5)==nf){ rep(_,5)s.pop_back(); s+=t; ans++; continue; } ll ls=s.size(); if(cnt>=2)ls=min(ls,5LL); string ns; bool flag=false; while(ls--){ if(s.back()=='e'){ ns+='h';flag=true; } else if(s.back()=='h'){ flag=true; } else ns+=s.back(); s.pop_back(); } rev(all(ns)); s+=ns; if(!flag)break; cnt++; } return cnt; } int main(){ string s;cin >> s;s.push_back('p'); string t; ll res=0; rep(i,s.size()+1){ if(s[i]=='p'){ chmax(res,solve(t));t.clear(); t+='p'; } else t+=s[i]; } cout << ans+res<< endl; }