#include <bits/stdc++.h>
#define FastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

void solve() {
  string n;
  cin >> n;

  if (n.size() == 0) {
    cout << "ham" << '\n';
    return;
  }

  string bin{};
  for (size_t i = 0; i < n.size();) {
    if (n.substr(i, 4) == "hamu") {
      bin += "1";
      i += 4;
    } else {
      bin += "0";
      i += 3;
    }
  }

  // bin to int
  int num{0};
  int exp{(int)bin.size() - 1};
  for (const auto b : bin) {
    if (b == '1') num += (int)pow(2, exp);
    exp--;
  }

  num *= 2;
  auto binary = bitset<10>(num);
  bool firstHamu = false;

  for (int i = (int)binary.size() - 1; i >= 0; i--) {
    if (binary[i]) {
      cout << "hamu";
      firstHamu = true;
    } else if (!binary[i] && firstHamu == true) {
      cout << "ham";
    }
  }
  cout << '\n';
}

int main() {
  FastIO;
  solve();
  return 0;
}