There are n block towers in a row, where tower i has a height of a_i. You're part of a building crew, and you want to make the buildings look as nice as possible. In a single day, you can perform the following operation:

  * Choose two indices i and j (1 ≤ i, j ≤ n; i ≠ j), and move a block from tower i to tower j. This essentially decreases a_i by 1 and increases a_j by 1. 



You think the ugliness of the buildings is the height difference between the tallest and shortest buildings. Formally, the ugliness is defined as max(a)-min(a). 

What's the minimum possible ugliness you can achieve, after any number of days?

Input

The first line contains one integer t (1 ≤ t ≤ 1000) — the number of test cases. Then t cases follow.

The first line of each test case contains one integer n (2 ≤ n ≤ 100) — the number of buildings.

The second line of each test case contains n space separated integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^7) — the heights of the buildings.

Output

For each test case, output a single integer — the minimum possible ugliness of the buildings.

Example

Input


3
3
10 10 10
4
3 2 1 2
5
1 2 3 1 5


Output


0
0
1

Note

In the first test case, the ugliness is already 0.

In the second test case, you should do one operation, with i = 1 and j = 3. The new heights will now be [2, 2, 2, 2], with an ugliness of 0.

In the third test case, you may do three operations: 

  1. with i = 3 and j = 1. The new array will now be [2, 2, 2, 1, 5], 
  2. with i = 5 and j = 4. The new array will now be [2, 2, 2, 2, 4], 
  3. with i = 5 and j = 3. The new array will now be [2, 2, 3, 2, 3]. 

The resulting ugliness is 1. It can be proven that this is the minimum possible ugliness for this test.
//package MyPackage;

import java.util.*;
import java.io.*;

public class codec{
    static class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br=new BufferedReader(new InputStreamReader(System.in));
        }
        String next(){
            while(st==null || !st.hasMoreTokens()){
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt(){
            return Integer.parseInt(next());
        }
        long nextLong(){
            return Long.parseLong(next());
        }
        double nextDouble(){
            return Double.parseDouble(next());
        }
        String nextLine(){
            String str="";
            try {
                str=br.readLine().trim();
            } catch (Exception e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    static class FastWriter {
		private final BufferedWriter bw;

		public FastWriter() {
			this.bw = new BufferedWriter(new OutputStreamWriter(System.out));
		}

		public void print(Object object) throws IOException {
			bw.append("" + object);
		}

		public void println(Object object) throws IOException {
			print(object);
			bw.append("\n");
		}

		public void close() throws IOException {
			bw.close();
		}
	}
    public static void main(String[] args) {
        try {
            FastReader in=new FastReader();
            FastWriter out = new FastWriter();
	    StringBuilder sb = new StringBuilder();
            int testCases=in.nextInt();
            while(testCases-- > 0){
                // write code here
            	int n = in.nextInt();
            	int ar[] = new int[n];
            	for(int i = 0; i < n; i++)
            	{
            		ar[i] = in.nextInt();
            	}
            	int min = Integer.MAX_VALUE;
            	HashMap<Integer, Integer> map = new HashMap<>();
            	for(int i: ar)
            	{
            		map.put(i, map.getOrDefault(i, 0) + 1);
            	}
            	List<Integer> a = new ArrayList<>();
            	for(int i: map.keySet())
            	{
            		if(map.get(i) == 1)
            		{
            			a.add(i);
            		}
            	}
            	int l = a.size();
            	for(int i = 0; i < l; i++)
            	{
            		for(int j = i + 1; j < l; j++)
            		{
            			min = Math.min(min, (a.get(j) - a.get(i)));
            		}
            	}
            	if(l == 0)
            		sb.append(0 + "\n");
            	else
            	{
	            	if(min % 2 == 1)
	            		sb.append(1 + "\n");
	            	else
	            		sb.append(0 + "\n");
            	}
            }
            out.println(sb);
            out.close();
        } catch (Exception e) {
            return;
        }
    }
}