#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    string sss;
    cin >> sss;
    int flag = 0;
    rep(i,sss.size()){
        if(sss[i] = 'p')flag = 1;
    }
    if(flag == 0){
        rep(i,sss.size()){
            if(sss[i] == 'h' || sss[i] == 'e'){
                cout << 1 << endl;
                return 0;
            }
        }
        cout << 0 << endl;
        return 0;
    }
    vector<string> s;
    string ss;
    int n = 0;
    rep(i,sss.size()){
        if(sss[i] == 'p'){
            if(n > 0){
                s.push_back(ss);
            }
            ss.clear();
            n++;
            ss += sss[i];
        }else{
            if(n == 0)continue;
            ss += sss[i];
        }   
    }
    s.push_back(ss);

    int ans = 0;
    flag = 0;
    rep(i,sss.size()){
        if(sss[i] == 'h' || sss[i] == 'e'){
            flag = 1;
        }
    }

    if(flag == 0){
        cout << 0 << endl;
        return 0;
    }

    rep(i,n){
        if(s[i].size() < 5)continue;
        if(s[i][0] == 'p' && s[i][1] == 'h' && s[i][2] == 'n' && s[i][3] == 'o' && s[i][4] == 'm'){
            ss = "penh";
            srep(j,5,s[i].size()){
                ss += s[i][j];
            }
            s[i] = ss;
            ans++;
        }
    }

    rep(i,n){
        ss.clear();
        rep(j,s[i].size()){
            if(s[i][j] == 'h'){
                ;
            }else if(s[i][j] == 'e'){
                ss += 'h';
            }else{
                ss += s[i][j];
            }
        }
        s[i] = ss;
    }
    ans++;

    rep(i,n){
        if(s[i].size() < 5)continue;
        if(s[i][0] == 'p' && s[i][1] == 'h' && s[i][2] == 'n' && s[i][3] == 'o' && s[i][4] == 'm'){
            ss = "penh";
            srep(j,5,s[i].size()){
                ss += s[i][j];
            }
            s[i] = ss;
            ans++;
        }
    }

    flag = 0;
    rep(i,n){
        ss.clear();
        rep(j,s[i].size()){
            if(s[i][j] == 'h'){
                flag = 1;
            }else if(s[i][j] == 'e'){
                flag = 1;
                ss += 'h';
            }else{
                ss += s[i][j];
            }
        }
        s[i] = ss;
    }

    if(flag)ans++;


    int turn = 0;

    rep(i,n){
        int flag2 = 1;
        int tmp = 0;
        rep(j,s[i].size()){
            if(j == 0){
                ;
            }else if(j == 1){
                if(s[i][j] != 'h'){
                    flag2 = 0;
                    break;
                }
                tmp = 1;
            }else if(j == 2){
                if(s[i][j] != 'n'){
                    break;
                }
            }else if(j % 2 == 1){
                if(s[i][j] != 'o'){
                    break;
                }
            }else{
                if(s[i][j] != 'm'){
                    break;
                }
                ans++;
                tmp++;
            }
        }
        turn = max(turn, tmp);
    }
    ans += turn;

    // cout << "OK" << endl;
    cout << ans << endl;
    return 0;
}