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.$1\le a\le n.$ If it’s Mahmoud’s turn,

If the current player can’t choose any number satisfying the conditions, he loses. Can you determine the winner if they both play optimally?

Input

The only line contains an integer n(1≤n≤109)$n(1\le n\le {10}^9)$, the number at the beginning of the game.

Output

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

Examples

input

1

output

Ehab

input

2

output

Mahmoud

Note

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.

題解

如果n$n$為偶數，Mahmoud$Mahmoud$直接拿完；否則Mahmoud$Mahmoud$拿完後必定剩下一個奇數。

程式碼

#include<bits/stdc++.h>
using namespace std;
int n;
void in(){scanf("%d",&n);}
void ac(){n&1?puts("Ehab"):puts("Mahmoud");}
int main(){in();ac();}