#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  string s;
  cin >> s;
  map<char,int> cnt;
  for (auto it : s) cnt[it] += 1;
  if (cnt['M'] > cnt['E']) cout << "Mahfuz\n";
  else if (cnt['E'] > cnt['M']) cout << "Emon\n";
  else cout << "IDK\n";
  
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  // cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}