Taco Game Winner

Mina and Dora are playing a game where they alternate turns selecting a subarray from a given array. The subarray chosen does not affect the outcome directly; rather, the rule is simplified. In each test case, if the number of elements in the array, n, satisfies \[ n \bmod 2 = 1 \] then Mina (who always starts first) wins; otherwise, Dora wins. Your task is to determine the winner for each test case.

Note: Although the game description may sound like it requires complex strategies (such as selecting the subarray with the maximum sum), the winning condition is solely based on the parity of n.

inputFormat

The first line contains an integer T, the number of test cases. For each test case, the first line contains an integer n indicating the size of the array. The next line contains n integers representing the array elements.

outputFormat

For each test case, output a single line containing the winner of the game. Print Mina if Mina wins, or Dora otherwise.

2
5
1 2 3 4 5
4
-1 -2 -3 -4

Mina
Dora