#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  


ll cnt=0;
string operate1(string &s){
  ll n=s.size();
  string ret;
  rep(i,0,n){
    if(i+5<=n&&s.substr(i,5)=="phnom"){
      ret+="penh";
      cnt++;
      i+=4;
    }
    else ret+=s[i];
  }
  return ret;
}
string operate2(string &s){
  ll n=s.size();
  string ret;
  bool sw=false;
  rep(i,0,n){
    if(s[i]=='e'){
      sw=true;
      ret+='h';
    }
    else if(s[i]!='h')ret+=s[i];
    else sw=true;
  }
  cnt+=sw;
  return ret;
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  string s;cin>>s;
  string now=s;
  rep(i,0,2){
    now=operate1(now);
    //cout<<now<<endl;
    now=operate2(now);
    //cout<<now<<endl;
  }
  ll n=now.size();
  ll mx=0;
  //cout<<cnt spa now<<endl;

  rep(i,0,n){
    if(i+3<=n&&now.substr(i,3)=="phn"){
      i+=3;
      ll now2=0;
      while(i<n-1&&now.substr(i,2)=="om"){
        now2++;i+=2;
      }
      i--;
      chmax(mx,now2);
      cnt+=now2;
    }
  }
  //cout<<cnt spa mx<<endl;
  if(mx>=1){
    cnt+=mx+1;
  }
  else{
    ll add=0;
    rep(i,0,now.size()){
      if(now[i]=='e')chmax(add,2LL);
      if(now[i]=='h')chmax(add,1LL);
    }
    cnt+=add;
  }
  cout<<cnt<<endl;
  return 0;
}