A11737. Mahmoud and Ehab and the even-odd game

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^{9})$ , the number at the beginning of the game.

Output "Mahmoud" (without quotes) if Mahmoud wins and "Ehab" (without quotes) otherwise.

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.