import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const S = readToken();
      const L = cast(int)(S.length);
      
      alias Entry = Tuple!(char, "c", int, "mx", int, "num");
      int len;
      auto stack = new Entry[L + 1];
      stack[len++] = Entry('$', -1, -1);
      int ans;
      
      void doIt() {
        int i = len - 1;
        int oth = -L - 10;
        if (stack[i].c != 'm') return;
        --i;
        if (stack[i].c == 'e') {
          chmax(oth, stack[i].mx);
          --i;
        }
        if (stack[i].c != 'o') return;
        --i;
        if (stack[i].c == 'e') {
          chmax(oth, stack[i].mx);
          --i;
        }
        if (stack[i].c != 'n') return;
        --i;
        if (stack[i].c != 'e') return;
        if (stack[i].mx <= oth) return;
        if (stack[i].num != 1) return;
        const t = stack[i].mx + 1;
        --i;
        if (stack[i].c != 'p') return;
        --i;
        
        ++ans;
        len = i + 1;
        stack[len++] = Entry('p', -1, -1);
        stack[len++] = Entry('e', t, 1);
        stack[len++] = Entry('n', -1, -1);
        stack[len++] = Entry('e', t - 1, 1);
      }
      
      foreach (c; S) {
        switch (c) {
          case 'e': {
            if (stack[len - 1].c == 'e') {
              if (chmax(stack[len - 1].mx, 0)) {
                stack[len - 1].num = 0;
              }
              if (stack[len - 1].mx == 0) {
                ++stack[len - 1].num;
              }
            } else {
              stack[len++] = Entry('e', 0, 1);
            }
          } break;
          case 'h': {
            if (stack[len - 1].c == 'e') {
              if (chmax(stack[len - 1].mx, -1)) {
                stack[len - 1].num = 0;
              }
              if (stack[len - 1].mx == -1) {
                ++stack[len - 1].num;
              }
            } else {
              stack[len++] = Entry('e', -1, 1);
            }
          } break;
          case 'm': {
            stack[len++] = Entry('m', -1, -1);
            doIt();
          } break;
          default: {
            stack[len++] = Entry(c, -1, -1);
          }
        }
        debug {
          foreach (i; 0 .. len) {
            writef("%s,%s,%s ", stack[i].c, stack[i].mx, stack[i].num);
          }
          writeln();
        }
      }
      
      int mx = -L - 10;
      foreach (i; 0 .. len) {
        if (stack[i].c == 'e') {
          chmax(mx, stack[i].mx);
        }
      }
      if (mx >= -1) {
        ans += mx + 2;
      }
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}