#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
    string s;
    cin >> s;
    bitset<20> bit;
    int co = 0;
    for (int i = s.size() - 1; i >= 0;) {
        if (s[i] == 'u') {
            bit[co] = 1;
            i -= 4;
            co++;
            continue;
        }
        else {
            bit[co] = 0;
            i -= 3;
            co++;
            continue;
        }
    }
    long long a = bit.to_ulong();
    a *= 2;
    bit = a;
    stack<string> que;
    for (int i = 0; i < 20; i++) {
        if (bit[i]) {
            que.push("hamu");
        }
        else {
            que.push("ham");
        }
    }
    bool b = false;
    while (!que.empty()) {
        if (que.top() == "hamu") {
            b = true;
        }
        if (b) {
            cout << que.top();
        }
        que.pop();
    }
    if (!b) {
        cout << "ham" << endl;
    }
    cout << endl;
    return 0;
}