Chef wants to buy a new laptop. However, he is confused about which laptop to buy out of 10 different laptops. He asks his N friends for their recommendation. The i^{th} friend recommends the Chef to buy the {A_{i}}^{th} laptop (1 ≤ A_{i} ≤ 10).

Chef will buy the laptop which is recommended by maximum number of friends. Determine which laptop Chef buys.
Print CONFUSED if there are multiple laptops having maximum number of recommendations.

------ Input Format ------

• The first line contains a single integer T - the number of test cases. Then the test cases follow.
• The first line of each test case contains an integer N - the number of Chef's friends.
• The second line of each test case contains $N space-separated integers A_{1}, A_{2}, \dots, A_{N}$ where A_{i} denotes the recommendation of the i^{th} friend.

------ Output Format ------

For each test case, output in a single line, the laptop which has the maximum number of recommendations. Print CONFUSED if there are multiple laptops having maximum number of recommendations.

You may print each character of CONFUSED in uppercase or lowercase (for example, Confused, coNFused, CONFused will be considered identical).

------ Constraints ------

$1 ≤ T ≤ 200$
$1 ≤ N ≤ 1000$
$1 ≤A_{i} ≤10$

----- Sample Input 1 ------
4
5
4 4 4 2 1
7
1 2 3 4 5 6 6
6
2 2 3 3 10 8
4
7 7 8 8

----- Sample Output 1 ------
4
6
CONFUSED
CONFUSED

----- explanation 1 ------
Test case 1: Laptop $4$ has the maximum number of recommendations. Therefore, Chef will buy the $4^{th}$ laptop.

Test case 2: Laptop $6$ has the maximum number of recommendations. Therefore, Chef will buy the $6^{th}$ laptop.

Test case 3: Laptops $2$, $3$ have the maximum number of recommendations. Therefore, Chef will still be CONFUSED.

Test case 4: Laptops $7$, $8$ have the maximum number of recommendations. Therefore, Chef will still be CONFUSED.

见题面

见题面