#include using namespace std; using ll = long long; using ld = long double; using P = pair; using Vec = vector; template using Vec1 = vector; template using Vec2 = vector >; #define all(s) (s).begin(), (s).end() #define pb push_back #define mp make_pair #define fs first #define sc second template bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;} template bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;} template ll pow2(const T n){return (1LL << n);} void sonic(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);} void setp(const ll n){cout << fixed << setprecision(n);} const ll INF = 1e9+1; const ll LINF = 1e18+1; const ll MOD = 1e9+7; //const ll MOD = 998244353; const ld PI = acos(-1); const ld EPS = 1e-11; int main(void){ string s; cin >> s; string ph1 = "phnom", ph2 = "penh"; ll cnt = 0; bool flg; while(true){ flg = false; for(ll i = (ll)s.size()-4; i >= 0; --i){ if(s.substr(i, 5) == ph1){ s[i+1] = 'e', s[i+2] = 'n', s[i+3] = 'h'; s.erase(i+4, 1); cnt++; flg = true; } } if(flg) continue; flg = false; for(ll i = s.size()-1; i >= 0; --i){ if(s[i] == 'h'){ s.erase(i, 1); flg = true; }else if(s[i] == 'e'){ s[i] = 'h'; flg = true; } } if(flg) cnt++; else break; } cout << cnt << endl; return 0; }