Josh is bored of playing Nim, so he has decided to make his own variant! He will play against Mike, with the following rules:

There are $N$ piles of stones labelled from $1$ to $N$, with the $i$-th pile initially containing $a_i$ stones. Josh and Mike will take alternating turns, with Josh going first. On each turn:

• The current player should select a pile $i$ which contains at least one stone. If no such pile exists, then the current player immediately loses and their opponent wins.
• Then, their opponent will remove any positive integer number of stones from pile $i$ of their choosing. Of course, they cannot remove more stones from pile $i$ than there are currently.

If both Josh and Mike play optimally, who will win? You are to answer this question for $T$ separate games.

Constraints

$1\le T,N\le {10}^6$

The sum of $N$ over all games does not exceed ${10}^6$.

$1\le a_i\le {10}^9$

Subtask 1 [20%]

$a_1=a_2=\cdots =a_N=1$

Subtask 2 [20%]

$a_1=a_2=\cdots =a_N$

Subtask 3 [60%]

No additional constraints.

Input Specification

The first line contains a single integer, $T$, denoting the number of games. Then, $T$ pairs of lines follow, with the $i$-th pair describing the $i$-th game.

The first line of each pair contains a single integer, $N$.

The second line of each pair contains $N$ space-separated integers, $a_1,a_2,\dots ,a_N$.

Output Specification

Output $T$ lines. The $i$-th line should contain Josh if Josh will win, and Mike if Mike will win.

Sample Input

2
1
2
2
1 2

Sample Output

Mike
Josh

Explanation

In the first game, Josh has no choice but to choose pile $1$. Then, Mike can remove one stone from this pile. On Mike's turn, he will again choose pile $1$, and Josh will be forced to remove the remaining stone. On Josh's next turn, all of the piles are empty, so Josh loses.

In the second game, Josh can begin by choosing pile $1$. Then, Mike will be forced to remove the only stone from this pile, making it empty. There is now only one pile left, containing $2$ stones, so using our logic from the first game, we can determine that Josh can force a win.