// >>> TEMPLATES #include using namespace std; using ll = long long; using ld = long double; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second #define INF32 (numeric_limits::max()/2-1) #define INF64 (numeric_limits::max()/2-1) #define INF (numeric_limits::max()/2-1) #ifdef LOCAL #include "debug.hpp" #define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__) #define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl #define debug if (1) #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template using pque_max = priority_queue; template using pque_min = priority_queue, greater >; template ::value>::type> ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; } template ::value>::type> istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward(f)) {} template constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward(x)...); } }; struct MakeFixPoint { template constexpr auto operator|(F&& f) const { return FixPoint(forward(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template struct vec_impl { using type = vector::type>; template static type make_v(size_t n, U&&... x) { return type(n, vec_impl::make_v(forward(x)...)); } }; template struct vec_impl { using type = T; static type make_v(T const& x = {}) { return x; } }; template using vec = typename vec_impl::type; template auto make_v(Args&&... args) { return vec_impl::make_v(forward(args)...); } template void quit(T const& x) { cout << x << endl; exit(0); } template constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; } template constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits::value_type{}); } template int sz(T const& x) { return x.size(); } template int lbd(C const& v, T const& x) { return lower_bound(v.begin(), v.end(), x)-v.begin(); } template int ubd(C const& v, T const& x) { return upper_bound(v.begin(), v.end(), x)-v.begin(); } // <<< int solve(string s) { auto replace = [&](string const& s1, string const& s2) { bool flag = false; while (1) { auto pos = s.find(s1); if (pos == string::npos) break; flag = true; s.replace(pos, s1.size(), s2); } return flag; }; auto f1 = [&]{ return replace("phnom", "penh"); }; auto f2 = [&]{ bool x = replace("h", ""); bool y = replace("e","h"); return x || y; }; int ret = 0; rep (_,2) { if (f1()) { dump("f1",s); ret++; } else if (f2()) { dump("f2",s); return ++ret; } else { return ret; } if (f2()) { dump("f2",s); ret++; } else { return ret; } } dump(s); assert(s.find("phn") != string::npos); int ma = 0; size_t pos = 0; while (1) { pos = s.find("phn", pos); if (pos == string::npos) break; dump(pos); pos += 3; dump(s[pos],s[pos+1]); int cnt = 0; while (pos+1 < s.size() && s[pos] == 'o' && s[pos+1] == 'm') { cnt++, pos += 2; } dump(cnt); chmax(ma, cnt); } dump(ma); ret += ma*2+1; return ret; } int32_t main() { string s; cin >> s; string tmp,t; for (char c : s) if (c != 'h') tmp += c; for (char c : tmp) t += (c == 'e' ? 'h' : c); dump(s,t); int ans = solve(s); dump(ans); if (s != t) chmax(ans, solve(t)+1); cout << ans << endl; }