Monk and Mariam are playing the game of OXA. The game starts by Mariam writing an array A of N numbers on a sheet of paper. An OXA value can be calculated by choosing a subset of numbers from the set and applying the operations OR-XOR-ADD cyclically i.e. say the chosen numbers are 4, 6, 1, 5, 7 . . . . . , the OXA value of this subset will be = ( ( ( (4 OR 6 ) XOR 1 ) + 5) OR 7) XOR ... and so on, where OR, XOR stand for bitwise OR and XOR operations. The ordering of numbers in the subset will be retained from the main set.
The challenge for Monk is to observe the numbers carefully and predict the parity of the maximum OXA value possible from any chosen subset of numbers.
The Monk will predict the parity (whether the maximum OXA value is even or odd), in the form string S, which will either contain "Even" or "Odd" (without quotes). If the Monk prediction comes to be true, then he will win the game else Mariam will win the game.
You are given Monk's prediction and the array A, analyze the array and announce the winner of the Game of OXA !
Input:
The first line consists of an integer T. T testcases follow.
The first line of each testcase consists of a string S, Monk's prediction.
The second line of each testcase consists of an integer N.
In next N lines, each line will contain 1 integer denoting the elements of the array.
Output:
For each testcase, print the answer in a new line i.e. either "Monk" (without the quotes) or "Mariam" (without the quotes).
Constraints:
1≤T≤10
S is either "Even" or "Odd", without the quotes
1≤N≤16
0≤A[i]≤105
In the first testcase, the maximum OXA value is 17, (obtained from subset {4,5,2,10} i.e. ( (4 OR 5) XOR 2 ) + 10= 17). Monk predicted "Even" and hence, Mariam wins.
In the second testcase, the maximum OXA value is 5, (obtained from subset {5}). Monk predicted "Odd" and hence, Monk wins.
