#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
#define FIX(a) fixed << setprecision(a)
string str;
int n, c, d;

int main() {
    cin >> str;
    string t;
    rep(i, SZ(str)) {
        if (str[i] == 'h' && str[i + 1] == 'a' && str[i + 2] == 'm' && str[i + 3] == 'u') {
            t += '1';
            i += 3;
        } else if (str[i] == 'h' && str[i + 1] == 'a' && str[i + 2] == 'm') {
            t += '0';
            i += 2;
        }
    }
    // out(t);
    int tmp = 0;
    for (int i = SZ(t) - 1; i >= 0; --i) {
        if (t[i] == '0') continue;
        tmp += pow(2, SZ(t) - 1 - i);
        // out(tmp);
    }
    tmp *= 2;
    // out(tmp);
    t = "";
    while (tmp) {
        t += tmp % 2 + '0';
        tmp /= 2;
    }
    // out(t);
    reverse(all(t));
    rep(i, SZ(t)) {
        if (t[i] == '1') cout << "hamu";
        else cout << "ham";
    }
    cout << endl;
}