Maximum Elegance

You are given T test cases. For each test case, you are provided an integer N followed by an array of N integers. The elegance of an array is defined as the maximum frequency of any element in the array. In other words, if each element is counted, the elegance is equal to the maximum count among all elements.

Your task is to determine and print the elegance of the array for each test case.

The problem can be mathematically described as follows: Let an array be \(A = [a_1,a_2,\dots, a_N]\). Define the frequency function \(f(x)\) as the number of times \(x\) appears in \(A\). You need to output \(\max_{x\in A} f(x)\) for each test case.

inputFormat

The input is read from standard input (stdin). The first line contains an integer T representing the number of test cases. Each test case is described in two lines. The first line of each test case contains the integer N (the size of the array). The second line contains N space-separated integers which form the array.

outputFormat

For each test case, output the maximum elegance (i.e., the maximum frequency of any element in the array) on a new line to standard output (stdout).

## sample

3
5
1 2 2 3 3
6
5 5 5 5 5 5
4
1 2 3 4

2
6
1

</p>