Maximum Frequency Number Problem Statement

Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

If multiple elements have the same maximum frequency, return the element that appears first in the array (i.e., the element with the lowest index).

Input

```The first line contains an integer 'T' which denotes the number of test cases. For each test case, the input consists of: - An integer 'N' on the first line denoting the size of the array. - 'N' space-separated integers on the second line denoting the elements of the array.```

Output

```For each test case, print the integer that has the maximum frequency on a new line.```

Example

```Input arr: [1, 2, 3, 1, 2] Output: 1```

Constraints

• 1 <= T <= 5
• 1 <= N <= 10000
• -10^3 <= |arr[i]| <= 10^3

Note

```You are not required to handle input or output operations. Simply implement the required function.```