description: 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.
solution: import java.util.*;
  import java.io.*;
  
  public class Main {
  	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 FastReader obj = new FastReader();
  	public static PrintWriter out = new PrintWriter(System.out);
  
  	public static void sort(long[] a) {
  		ArrayList<Long> arr = new ArrayList<>();
  		for (int i = 0; i < a.length; i++)
  			arr.add(a[i]);
  		Collections.sort(arr);
  		for (int i = 0; i < arr.size(); i++)
  			a[i] = arr.get(i);
  	}
  
  	public static void revsort(long[] a) {
  		ArrayList<Long> arr = new ArrayList<>();
  		for (int i = 0; i < a.length; i++)
  			arr.add(a[i]);
  		Collections.sort(arr, Collections.reverseOrder());
  		for (int i = 0; i < arr.size(); i++)
  			a[i] = arr.get(i);
  	}
  
  	//Cover the small test cases like for n=1 .
  	public static class pair {
  		long a;
  		long b;
  
  		pair(long x, long y) {
  			a = x;
  			b = y;
  		}
  	}
  
  	public static long l() {
  		return obj.nextLong();
  	}
  
  	public static int i() {
  		return obj.nextInt();
  	}
  
  	public static long[] i(int n) {
  		long[] arr = new long[n];
  		for (int i = 0; i < n; i++)
  			arr[i] = l();
  		return arr;
  	}
  
  	public static void p(long val) {
  		System.out.println(val);
  	}
  
  	public static void p(String s) {
  		System.out.println(s);
  	}
  
  	public static void p(long[] arr) {
  		for (int i = 0; i < arr.length; i++) {
  			out.print(arr[i] + " ");
  		}
  		out.println();
  	}
  
  	public static void sortpair(ArrayList<pair> arr) {
  		//ascending just change return 1 to return -1 and vice versa to get descending.
  		//compare based on value of pair.a
  		arr.sort(new Comparator<pair>() {
  			public int compare(pair o1, pair o2) {
  				long val = o1.a - o2.a;
  				if (val == 0)
  					return 0;
  				else if (val > 0)
  					return 1;
  				else
  					return -1;
  			}
  		});
  	}
  
  	public static void main(String[] args) {
  
  		int len = i();
  		while (len-- != 0) {
  			int n = i();
              long[] num=i(n);
              long sum=0;
              for(int i=0;i<n;i++)
              {
                sum+=num[i]; 
              }
              if(sum%n==0)out.println("0");
              else out.println("1");
              
  		}
  		out.flush();
  	}
  }