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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.StringTokenizer;
  import java.util.Arrays;
  import java.util.ArrayList;
  import java.util.Comparator;
  import java.util.HashMap;
  import java.util.HashSet;
  import java.util.TreeSet;
  import java.util.TreeMap;
  import java.util.PriorityQueue;
  import java.util.Collections;
  
  import java.util.LinkedList;
  import java.util.Iterator;
  
  public class First {
  
      public static void main(String[] args) {
          FastScanner fs = new FastScanner();
          int T = fs.nextInt();
          for (int tt = 0; tt < T; tt++) {
  
              solve(fs);
          }
          
      }
      static void solve(FastScanner fs)
      {
          int n=fs.nextInt();
          int[] arr=takeInt(n, fs);
  
          int sum=0;
          for(int ele: arr)
              sum+=ele;
  
          if(sum%n==0)
              pn(0);
          else
              pn(1);
      }
      static int MOD=(int)(1e9+7);
      
      static long gcd(long a, long b) 
      {
          if (a == 0)
              return b;    
          return gcd(b%a, a);
      }
      static void pn(Object o) { System.out.println(o); } 
      static void p(Object o) { System.out.print(o); }
      static void flush() { System.out.flush(); }
  
      static void debugInt(int[] arr)
      {
          for(int i=0;i<arr.length;++i)
              System.out.print(arr[i]+" ");
          System.out.println();
      }
      static void debugIntInt(int[][] arr)
      {
          for(int i=0;i<arr.length;++i)
          {
              for(int j=0;j<arr[0].length;++j)
                  System.out.print(arr[i][j]+" ");
              System.out.println();
          }
          System.out.println();
      }
      static void debugLong(long[] arr)
      {
          for(int i=0;i<arr.length;++i)
              System.out.print(arr[i]+" ");
          System.out.println();
      }
      static void debugLongLong(long[][] arr)
      {
          for(int i=0;i<arr.length;++i)
          {
              for(int j=0;j<arr[0].length;++j)
                  System.out.print(arr[i][j]+" ");
              System.out.println();
          }
          System.out.println();
      }
      static long[] takeLong(int n, FastScanner fs)
      {
          long[] arr=new long[n];
          for(int i=0;i<n;++i)
              arr[i]=fs.nextLong();
          return arr;
      } 
      static long[][] takeLongLong(int m, int n, FastScanner fs)
      {
          long[][] arr=new long[m][n];
          for(int i=0;i<m;++i)
              for(int j=0;j<n;++j)
                  arr[i][j]=fs.nextLong();
          return arr;
      } 
      static int[] takeInt(int n, FastScanner fs)
      {
          int[] arr=new int[n];
          for(int i=0;i<n;++i)
              arr[i]=fs.nextInt();
          return arr;
      } 
      static int[][] takeIntInt(int m, int n, FastScanner fs)
      {
          int[][] arr=new int[m][n];
          for(int i=0;i<m;++i)
              for(int j=0;j<n;++j)
                  arr[i][j]=fs.nextInt();
          return arr;
      } 
      static void sort(int[] a) {
          ArrayList<Integer> l=new ArrayList<>();
          for (int i:a) l.add(i);
          Collections.sort(l);
          for (int i=0; i<a.length; i++) a[i]=l.get(i);
      }
      static boolean[] sieve()
      {
          int size=(int)(1e5+5);
          boolean[] isPrime=new boolean[size];
          Arrays.fill(isPrime, true);
          for(int i=2;i<size;++i)
              for(int j=2*i;isPrime[i]==true && j<size;j+=i)
                  isPrime[j]=false;
  
          return isPrime;
      }
      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 nextInt() {
              return Integer.parseInt(next());
          }
          long nextLong() {
              return Long.parseLong(next());
          }
      }
  
  
  }
  class Pair
  {
      
  }