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.


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


/* Name of the class has to be "Main" only if the class is public. */
public class Pupil
{
   
	
    static FastReader sc = new FastReader();

	public static void main (String[] args) throws java.lang.Exception
	{
	           	
	// your code goes here
             int t=sc.nextInt();
             while(t>0){
            	 int n=sc.nextInt();
            	long sum=0;
            	for(int i=0;i<n;i++)
            	{
            		long val=sc.nextLong();
            		sum+=val;
            	}
            	if(sum%n==0)
            	{
            		System.out.println("0");
            	}
            	else {
            		System.out.println("1");
            	}











              t--;
                }

   

 
 
         
		}
	
	
	
	
	//	FAST I/O
	static class FastReader {
        BufferedReader br;
        StringTokenizer st;
        
        public FastReader()
        {
            br = new BufferedReader(
                new InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements()) {
                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();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
	}

public static boolean two(int n)//power of two
{
if((n&(n-1))==0)
{
return true;
}
else{
return false;
}
	
}	





public static boolean isPrime(long n){
		    
		    for (int i = 2; i * i <= n; ++i) {
            if (n % i == 0) {
                return false;
            }
        }
 
        return true;
		}


public static int digit(int n)
{
    int n1=(int)Math.floor((int)Math.log10(n)) + 1;
    return n1;
}


 
public static long gcd(long a,long b) {
	if(b==0)
		return a;
	return gcd(b,a%b);
}
 
 
 
 








 }
 
 //CAAL THE BELOW FUNCTION IF PARING PRIORITY IS NEEDED //
 
//  PriorityQueue<pair> pq = new PriorityQueue<>(); **********declare the syntax in the main function******
// pq.add(1,2)///////
 
// class pair implements Comparable<pair> {
// 	int value, index;
 
// 	pair(int v, int i) { index = i; value = v; }
 
// 	@Override
// 	public int compareTo(pair o) { return o.value - value; }
// }
 

// User defined Pair class
// class Pair {
//     int x;
//     int y;
  
//     // Constructor
// public Pair(int x, int y)
//     {
//         this.x = x;
//         this.y = y;
//     }
// }


        //     Arrays.sort(arr, new Comparator<Pair>() {
        //     @Override public int compare(Pair p1, Pair p2)
        //     {
        //         return p1.x - p2.x;
        //     }
        // });




// class Pair {
 //       int height, id;
// 
//        public Pair(int i, int s) {
//            this.height = s;
//            this.id = i;
//        }
//    }
        



 
 
 //Arrays.sort(trips, (a, b) -> Integer.compare(a[1], b[1]));
 
// 		ArrayList<ArrayList<Integer>> connections = new ArrayList<ArrayList<Integer>>();
// 		for(int i = 0; i<n;i++)
// 			connections.add(new ArrayList<Integer>());