Fun Isolation

Limits: 1 sec., 256 MiB

This statement was translated automatically from Ukrainian.

Zenyk and Marichka finally went on a foreign trip. Due to the burdock virus, they have to spend a whole week in a hotel in isolation. To somehow entertain themselves, they decided to play one of their favorite games.

Initially, there is an array of length \(n\), consisting of numbers 0 and 1. Marichka and Zenyk take turns. Zenyk goes first. On his turn, a player can choose any subarray with an even sum and replace all its elements with zeros, or choose any subarray with an odd sum and replace all elements with ones.

Zenyk wins if at some point all elements of the array are zeros, and Marichka wins if they are ones.

Can you determine who wins if both players play optimally?

Input

The first line contains an integer \(n\) — the length of the array.

The second line contains \(n\) space-separated integers, each of which is 0 or 1.

Output

Print Zenyk if Zenyk wins with optimal play, or Marichka — otherwise.

Constraints

\(1 \le n \le 10^5\).

Samples

Input (stdin) сopy	Output (stdout) сopy
4 1 0 1 0	Zenyk

Input (stdin) сopy	Output (stdout) сopy
4 1 0 1 1	Marichka

Notes

In the first example, Zenyk can win on the first move, because the sum of the entire array is even.

In the second example, no matter what move Zenyk chooses, Marichka wins: Zenyk can either make all elements equal to 1 and lose immediately, or make the sum of the entire array odd, after which Marichka wins on her turn.