CF959A Mahmoud and Ehab and the even-odd game

最新推荐文章于 2024-01-27 16:30:21 发布

原创最新推荐文章于 2024-01-27 16:30:21 发布 · 436 阅读

0 ·

CC 4.0 BY-SA版权

本文解析了CodeForces上的一道A级题目，详细介绍了Mahmoud和Ehab之间的Even-Odd游戏策略。通过分析游戏规则，得出当初始数字为偶数时，Mahmoud获胜；否则，Ehab获胜的结论。

原题链接：http://codeforces.com/contest/959/problem/A

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?

Input

The only line contains an integer $n (1 ≤ n ≤ 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

output

Ehab

input

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$ 为偶数， $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();}