#define _USE_MATH_DEFINES #include using namespace std; vector> doit1 (string s) { vector> res; int cnt = 0; int n = (int) s.size() - 1; string t; for (int i = 0; i < n; i++) { if (s.substr(i, 2) == "om") { cnt++; i++; } else { if (cnt > 0) { res.emplace_back(t, cnt); t = ""; } cnt = 0; t += s[i]; } } if (cnt > 0) res.emplace_back(t, cnt); return res; } signed main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; int n = (int) s.size(); vector> be = doit1 (s); vector type1, type2; for (auto& p : be) { //cerr << p.first << " " << p.second << endl; int m = (int) p.first.size(); if (p.first.substr(m - 3) == "phn") { type1.push_back(p.second); continue; } int ecount = 0, ncount = 0, other = 0; int i; for (i = m - 1; i >= 0; i--) { if (s[i] == 'p') break; if (s[i] == 'e') ecount++; else if (s[i] == 'n') ncount++; else if (s[i] != 'h') other++; } if (i >= 0 && ecount == 1 && ncount == 1 && other == 0) { type2.push_back(p.second); } } // for (int i : type1) cerr << i << " "; // cerr << endl; // for (int i : type2) cerr << i << " "; // cerr << endl; long long ans = 0; if (type1.empty() && type2.empty()) { int ecount = 0, hcount = 0; for (int i = 0; i < n; i++) { if (s[i] == 'e') ecount++; if (s[i] == 'h') hcount++; } if (hcount) ans = 1; if (ecount) ans = 2; } else if (type2.empty()) { sort(type1.begin(), type1.begin()); ans += type1.back() + 1; for (int i : type1) ans += i; } else if (type1.empty()) { sort(type2.begin(), type2.begin()); ans += type2.back() + 1; for (int i : type2) ans += i; ans += 1; } else { for (int i : type1) { ans++; if (i > 0) type2.push_back(i - 1); } sort(type2.begin(), type2.begin()); ans += type2.back() + 1; for (int i : type2) ans += i; ans += 1; } cout << ans << endl; return 0; }