#include <bits/stdc++.h>

using namespace std;


using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 58) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  string S;
  cin >> S;

  vector< string > beet;
  beet.emplace_back("$");
  for(int i = 0; i < S.size(); i++) {
    if(S[i] == 'p') {
      beet.emplace_back("");
    } else if(beet.size()) {
      beet.back() += S[i];
    }
  }

  int ret = 0, max_depth = 0;
  for(auto &p : beet) {

    set< int > ev;
    for(int i = 0; i < p.size(); i++) {
      if(p[i] == 'h' || p[i] == 'e') ev.emplace(i);
    }

    set< int > alive;
    for(int i = 0; i < p.size(); i++) alive.emplace(i);


    bool update = true;
    int sum = 0, depth = 0;

    while(update) {
      update = false;
      if(alive.size() >= 4) {
        auto a = alive.begin();
        auto b = a;
        ++b;
        auto c = b;
        ++c;
        auto d = c;
        ++d;


        if(p[*a] == 'h' && p[*b] == 'n' && p[*c] == 'o' && p[*d] == 'm') {
          if(ev.count(*a)) ev.erase(*a);
          if(ev.count(*b)) ev.erase(*b);
          if(ev.count(*c)) ev.erase(*c);
          if(ev.count(*d)) ev.erase(*d);


          update = true;
          sum++;
          p[*a] = 'e';
          p[*b] = 'n';
          p[*c] = 'h';
          ev.emplace(*a);
          ev.emplace(*c);


          alive.erase(d);
        }
      }

      if(ev.size()) {
        update = true;
        set< int > nxt;
        for(auto &t : ev) {
          if(p[t] == 'h') {
            alive.erase(t);
          } else {
            p[t] = 'h';
            nxt.emplace(t);
          }
        }
        ev.swap(nxt);
        depth++;
      }
    }
    ret += sum;
    chmax(max_depth, depth);
  }
  cout << ret + max_depth << endl;
}