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 a_i and a_j; 
  * 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 ≤ 10^4). Then t test cases follow.

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

The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9).

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

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
import java.util.*;
import java.io.*;
public class D {
	public static void main(String[] args)  throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());
		while(t-- > 0){
			int n = Integer.parseInt(br.readLine());
			String[] st = br.readLine().split(" ");
			int[] arr = new int[n];
			for(int i=0;i<n;i++){
				arr[i]=Integer.parseInt(st[i]);
			}
			HashMap<Integer,Integer> map = new HashMap<>();
			int max=0;
			for(int i=0;i<n;i++){
				int f = map.getOrDefault(arr[i],0);
				f++;
				map.put(arr[i],f);
				max=Math.max(max,f);
			}
			if(max==n){
				System.out.println(max);
			}
			else if(max>n/2){
				System.out.println(max+max-n);
			}else{
				if(n%2==0){
					System.out.println("0");
				}else{
					System.out.println("1");
				}
			}
		}
	}
}
