#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define int long long

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

int enc(string s)
{
    int N = s.size();
    int res = 0;
    int pos = 0;
    while (N >= 3) {
        res *= 2;
        if (N >= 4 && s.substr(pos, 4) == "hamu") {
            res += 1;
            pos += 4;
            N -= 4;
        } else {
            pos += 3;
            N -= 3;
        }
    }
    return res;
}

string dec(int a)
{
    stringstream ss;

    vector<string> vs;

    do {
        vs.PB(a % 2 == 0 ? "ham" : "hamu");
        a /= 2;
    } while (a);

    reverse(all(vs));

    rep(i, vs.size()) ss << vs[i];

    return ss.str();
}

signed main()
{ // #define int long long をしてるのでscanfを使うと意味不明な値が入力され死にます
    string S; cin >> S;
    cout << dec(enc(S)*2) << endl;
}