#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = mod * mod; typedef pairP; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef long double ld; typedef pair LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); //typedef vector> mat; typedef vector vec; ll mod_pow(ll a, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * a%m; a = a * a%m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n%mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a*a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 18; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } using mP = pair; int dx[4] = { 0,1,0,-1 }; int dy[4] = { 1,0,-1,0 }; typedef modint Data; typedef vector Array; typedef vector mat; mat operator*(const mat &lhs, const mat &rhs) { mat ret(lhs.size(), Array(rhs[0].size(), 0)); rep(i, lhs.size())rep(j, rhs[0].size())rep(k, rhs.size()) { ret[i][j] = lhs[i][k]*rhs[k][j]+ret[i][j]; } return ret; } mat scalar(int sz, Data k) { mat ret(sz, Array(sz, 0)); rep(i, sz)ret[i][i] = k; return ret; } mat operator^(const mat &lhs, const ll n) { if (n == 0)return scalar(lhs.size(), 1); mat ret = (lhs*lhs) ^ (n / 2); if (n % 2) { ret = ret * lhs; } return ret; } void solve() { string s; cin >> s; int n = s.size(); int ans = 0; string cop; rep(i, n) { if (i + 5 <= n) { string u = s.substr(i, 5); if (u == "phnom") { ans++; cop += "penh"; i = i + 4; } else { cop.push_back(s[i]); } } else cop.push_back(s[i]); } s = cop; n = cop.size(); cop.clear(); rep(i, n) { if (s[i] == 'e') { cop.push_back('h'); } else if(s[i]!='h'){ cop.push_back(s[i]); } } if (s != cop)ans++; s = cop; n = s.size(); cop.clear(); rep(i, n) { if (i + 5 <= n) { string u = s.substr(i, 5); if (u == "phnom") { ans++; cop += "penh"; i = i + 4; } else { cop.push_back(s[i]); } } else cop.push_back(s[i]); } s = cop; n = s.size(); int dep = 0; rep(i, n) { if (s[i] == 'h')dep = max(dep, 1); if (s[i] == 'e')dep = max(dep, 2); if (i + 4 <= n) { string u = s.substr(i, 4); if (u == "penh") { int le = i + 4; int num = 0; while (le + 1 < n) { if (s[le] == 'o'&&s[le + 1] == 'm') { num++; le += 2; } else break; } ans += num; dep = max(dep, num + 2); } } } ans += dep; cout << ans << endl; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //init(); //int t; cin >> t; rep(i, t)solve(); solve(); stop return 0; }