#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 2147483647;
const ll INFL = 9223372036854775807;
const ll mod = 1000000007;



int main() {

	string s;
	cin >> s;

	string t = "";

	int i = -1;
	while (true) {
		i += 3;
		if (i >= s.size())break;
		if (i == s.size())t += '0';
		else if (i + 1 == s.size())t += '0';
		else if (s[i + 1] == 'u') {
			i++;
			t += '1';
		}
		else t += '0';
	}
	ll n = 0;
	reverse(ALL(t));
	REP(i, t.size()) {
		if (t[i] == '1') {
			n += pow(2, i);
		}
	}

	n += n;

	bool b = false;

	for (int i = 20; i >= 0; i--) {
		if (n&(1 << i)) {
			b = true;
			cout << "hamu";
		}
		else if (b)cout << "ham";
	}

	cout << endl;





	
	return 0;
	
}