#include using namespace std; typedef long long ll; #define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++) #define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++) #define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--) #define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--) #define all(x) (x).begin(), (x).end() #define sz(x) ((ll)(x).size()) #define len(x) ((ll)(x).length()) int main() { cin.tie(0); ios::sync_with_stdio(false); // ifstream in("input.txt"); // cin.rdbuf(in.rdbuf()); string s; cin >> s; string tmp = ""; vector v; rep(i, len(s)) { if (tmp == "ham") { if (s[i] == 'u') { v.push_back(1); tmp = ""; } else { v.push_back(0); tmp = s[i]; } } else { tmp += s[i]; } } if (tmp == "ham") v.push_back(0); ll raw = 0; reverse(all(v)); rep(i, sz(v)) { if (v[i] == 1) raw += 1 << i; } ll wet = raw * 2; vector wv; while(wet > 0) { wv.push_back(wet % 2); wet /= 2; } reverse(all(wv)); string ans = ""; rep(i, sz(wv)) ans += ((wv[i] == 1) ? "hamu" : "ham"); if (ans == "") ans = "ham"; cout << ans << endl; return 0; }