#include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <cstdio>
#include <cmath>
using namespace std;

int main() {
	stack<int>st;
	queue<int>que;
	string s;
	cin >> s;

	//ハムスター語→二進数
	int cnt = 0;
	for (int i = s.size()-1; i >= 0; i--) {
		if (s[i] == 'h') {
			if (cnt == 3)que.push(1);
			else que.push(0);
			cnt = 0;
		}
		else {
			cnt++;
		}
		//cout << cnt << endl;
	}

	//二進数→十進数
	int sum = 0;
	cnt = 1;
	while (que.size()) {
		int a = que.front();
		sum += cnt*a;
		cnt *= 2;
		que.pop();
	}
	sum *= 2;

	//十進数→二進数
	st.push(sum % 2);
	sum /= 2;
	while (sum) {
		st.push(sum % 2);
		sum /= 2;
	}
	
	while (st.size()) {
		if (st.top() == 1)cout << "hamu";
		else if (st.top() == 0)cout << "ham";
		st.pop();
	}
	cout << endl;
	return 0;
}