Mahmoud and Ehab play a game called the even-odd game. Ehab chooses his favorite integer *n* and then they take turns, starting from Mahmoud. In each player's turn, he has to choose an integer *a* and subtract it from *n* such that:
 -  1 ≤ *a* ≤ *n*. -  If it's Mahmoud's turn, *a* has to be even, but if it's Ehab's turn, *a* has to be odd. 
If the current player can't choose any number satisfying the conditions, he loses. Can you determine the winner if they both play optimally?
The only line contains an integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">9</sup>), the number at the beginning of the game.
In the first sample, Mahmoud can't choose any integer *a* initially because there is no positive even integer less than or equal to 1 so Ehab wins.

In the second sample, Mahmoud has to choose *a* = 2 and subtract it from *n*. It's Ehab's turn and *n* = 0. There is no positive odd integer less than or equal to 0 so Mahmoud wins.
1
Ehab
2
Mahmoud
10000
Mahmoud
33333
Ehab
5
Ehab
1000000000
Mahmoud
999999999
Ehab
123123123
Ehab
22222221
Ehab
22222220
Mahmoud
3
Ehab
4
Mahmoud
6
Mahmoud
7
Ehab
8
Mahmoud
9
Ehab
10
Mahmoud
536870912
Mahmoud
536870913
Ehab
536870911
Ehab
n = int(input())
res = "Ehab" if n & 1 == 1 else "Mahmoud"
print(res)
