Monk being the monitor of the class needs to have all the information about the class students. He is very busy with many tasks related to the same, so he asked his friend Mishki for her help in one task. She will be given heights of all the students present in the class and she needs to choose 2 students having heights $h_1$ and $h_2$ respectively, such that $h_1 > h_2$ and difference between the number of students having height $h_1$ and number of students having height $h_2$ is maximum.

Note: The difference should be greater than 0.

Video approach to solve this question: here

As Mishki has never been a monitor of the class, help her in the same. If there exists such students, then print the required difference else print "1" (without quotes).

Input:
The first line will consists of one integer T, which denotes the number of test cases.
For each test case:
One line consists of a integer N, denotes the number of students in the class.
Second line contains N space separated integers, where $i^{th}$ integer denotes the height of the $i^{th}$ student in the class.

Output:

For each test case, if the required difference exists then print its value, otherwise print 1. Print the answer for each test case in a new line.

Constraints:
$1 \le T \le 10$
$1 \le N \le 10^5$
$1 \le height\space of \space the\space student \le 10^6$