#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { string s; cin >> s; int x = 0; int two = 1; int n = s.size(); drep(i,n){ if(s[i] == 'u'){ x += 1 * two; two *= 2; i -= 3; }else{ two *= 2; i -= 2; } } x *= 2; int f[100] = {}; drep(i,100){ f[i] = x % 2; } if(s != "ham")s = s + "ham"; cout << s << endl; return 0; }