2021-06-06

You are given an array a of length n consisting of integers. You can apply the following operation, consisting of several steps, on the array a zero or more times:

you select two different numbers in the array ai and aj;
you remove i-th and j-th elements from the array.
For example, if n=6 and a=[1,6,1,1,4,4], then you can perform the following sequence of operations:

select i=1,j=5. The array a becomes equal to [6,1,1,4];
select i=1,j=2. The array a becomes equal to [1,4].
What can be the minimum size of the array after applying some sequence of operations to it?

Input
The first line contains a single integer t (1≤t≤104). Then t test cases follow.

The first line of each test case contains a single integer n (1≤n≤2⋅105) is length of the array a.

The second line of each test case contains n integers a1,a2,…,an (1≤ai≤109).

It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.

Output
For each test case, output the minimum possible size of the array after applying some sequence of operations to it.

Example
Input
5
6
1 6 1 1 4 4
2
1 2
2
1 1
5
4 5 4 5 4
6
2 3 2 1 3 1
Output
0
0
2
1
0

#include"stdio.h"
#include"string.h"
#include"algorithm"
using namespace std;
typedef long long ll;
ll a[4010011];
int main()
{
	ll i,j,k,n,m,x,t,v;
	scanf("%lld",&t);
	while(t--)
	{
		scanf("%lld",&n);
		for(i=0;i<n;i++)
		scanf("%lld",&a[i]);
		sort(a,a+n);
		if(n%2==0)
		k=n/2-1;
		else
		k=n/2-1;
		ll s=n;
		for(i=k,v=0,j=n-1;i>=v;)
		{
			if(a[i]!=a[j])
			{
				i--;j--;
				s=s-2;
			}
			else if(a[v]!=a[j])
			{
				v++;j--;
				s=s-2;
			}
			else
				break;	
		}
		printf("%lld\n",s);
	}
	return 0;
}