#include <algorithm>
#include <cmath>
#include <iostream>
#include <deque>
#include <vector>
#include <string>
#include <utility>
#include <queue>
#include <unordered_map>
#include <unordered_set>

using namespace std;

int main()
{
	string str;
	cin >> str;

	long long count = 0;

	while (true)
	{
		auto pos = str.find("phnom");
		if (pos != string::npos)
		{
			str = str.substr(0, pos) + "penh" + str.substr(pos + 5);
			++count;
		}
		else
		{
			bool isChanged = false;
			while (true)
			{
				auto pos = str.find_first_of("h");

				if (pos == string::npos)
				{
					break;
				}

				isChanged = true;
				if (pos == str.size() + 1)
				{
					str = str.substr(0, pos);
				}
				else
				{
					str = str.substr(0, pos) + str.substr(pos + 1);
				}
			}

			for(char& c: str)
			{
				if (c == 'e')
				{
					c = 'h';
					isChanged = true;
				}
			}

			if (!isChanged)
			{
				break;
			}
			++count;
		}
	}
	cout << count << endl;
}