J. The Square Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

It's hard to predict the winner when legends face each other, especially in chess.

Ahmad and Ahmad are playing a series of $$$n$$$ chess matches, and one of them will win more games than the other, as there will be no ties and $$$n$$$ is odd.

Can you predict the winner?

Input

The first and only line of the input contains a single integer $$$n$$$ ($$$1 \le n \le 10^9 - 1$$$) — the number of matches.

It is guaranteed that $$$n$$$ is odd.

Output

Output one line containing the name of the winner.

Example
Input
1
Output
Ahmad