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.io.*;
  import java.util.*;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.util.Collections;
  import java.io.InputStreamReader;
  
  public class taskA {
  
  
  
  
  
      public static void main(String[] args) throws IOException {
  
  
  //        try {
          //  Scanner in = new Scanner(System.in) ;
           StringBuilder sb = new StringBuilder() ;
          FastScanner in = new FastScanner();
  
           int t = in.ni() ;
        outer :   while (t-- > 0) {
            int n = in.ni() ;
            int a[] = in.na(n) ;
            long ans = 0 ;
            for (int i = 0; i <n ; i++) {
                ans += a[i] ;
            }
           
            if (ans%n == 0)
            System.out.println( 0);
            else System.out.println( 1);
  
        }
  
  
  
  
          out.flush();
          out.close();
  
  
  //        } catch (Exception e) {
  //            return;
  //        }
  
      }
  
      static long gcd ( long a, long b){
          return (b == 0) ? a : gcd(b, a % b);
      }
      static int gcd ( int a, int b){
          return (b == 0) ? a : gcd(b, a % b);
      }
  
      static void sort ( int ar[]){
          int n = ar.length;
          ArrayList<Integer> a = new ArrayList<>();
          for (int i = 0; i < n; i++) a.add(ar[i]);
          Collections.sort(a);
          for (int i = 0; i < n; i++) ar[i] = a.get(i);
      }
  
      static void sort1 ( long ar[]){
          int n = ar.length;
          ArrayList<Long> a = new ArrayList<>();
          for (int i = 0; i < n; i++) a.add(ar[i]);
          Collections.sort(a);
          for (int i = 0; i < n; i++) ar[i] = a.get(i);
      }
  
  
  
  
      static class FastScanner {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st = new StringTokenizer("");
  
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          int ni() {
              return Integer.parseInt(next());
          }
  
          long nl() {
              return Long.parseLong(next());
          }
  
          int[] na(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = ni();
              return a;
          }
  
      }
  
      static PrintWriter out = new PrintWriter(System.out);
  
  
  
  
  }
  
  
  
  
  
  
  