Number Sequence Winner

In this problem, there is a game played by two players: Alex and Jordan. The game is based on a sequence of non-negative integers. For each test case, you are given a sequence where the first integer, n, indicates the number of subsequent integers in the sequence. The winning rule is determined solely by the parity of n:

• If n is even, then Jordan wins.
• If n is odd, then Alex wins.

Your task is to determine the winner for each test case.

The mathematical representation of the rule is given by:

\[ \text{winner} = \begin{cases} \text{Jordan} & \text{if } n \bmod 2 = 0, \ \text{Alex} & \text{if } n \bmod 2 = 1. \end{cases} \]

inputFormat

The input is given via standard input (stdin) and has the following format:

1. The first line contains a single integer T representing the number of test cases.
2. Each of the next T lines describes a test case. Each test case consists of several space-separated integers. The first integer in each line is n, which indicates the number of subsequent non-negative integers provided in that test case.

For example, a test case line "2 3 1" indicates that n is 2 and the sequence is {3, 1}.

outputFormat

For each test case, output the winner on a separate line (stdout). If n is even, print Jordan; if n is odd, print Alex.

## sample

4
2 3 1
4 1 7 5 2
5 4 8 1 3 7
1 0

Jordan
Jordan
Alex
Alex

</p>