#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int solve(string s){
    int n=s.size();
    bool myon=0;
    vector<int> v;
    for(int i=0; i<n; i++){
        if(s[i]=='h') myon=1;
        if(!(i+4<=n-1 && s.substr(i, 5)=="phnom")) continue;
        int cnt=1;
        for(int j=i+5; j<n; j+=2){
            if(!(j<n-1 && s[j]=='o' && s[j+1]=='m')) break;
            cnt++;
        }
        v.push_back(cnt);
    }
    if(v.empty()){
        if(myon) return 1;
        else return 0;
    }
    int ans=*max_element(v.begin(), v.end());
    ans=ans*2+1;
    return ans;
}
int main()
{
    string s; cin>>s;
    int n=s.size();
    int ans=solve(s);
    string t;
    for(int i=0; i<n; i++){
        if(s[i]=='h') continue;
        t+=s[i];
        if(t.back()=='e') t.back()='h';
    }
    ans=max(ans, solve(t)+1);
    cout<<ans<<endl;
    return 0;
}