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 javax.swing.plaf.IconUIResource;
  import java.lang.reflect.Array;
  import java.text.CollationElementIterator;
  import java.util.*;
  import java.io.*;
  
  //Timus judge id- 323935JJ
  
  
  public class Main {
  
  
  
  
      //----------------------------------------------------------------------------------------------
      public static class Pair implements Comparable<Pair> {
          int x=0,y=0;
          int z=0;
          public Pair(int a, int b) {
              this.x=a;
              this.y=b;
  
          }
  
          public int compareTo(Pair o) {
              return this.x - o.x;
          }
      }
  
  
      public static int mod = (int) (1e9 + 7);
      static int ans = Integer.MAX_VALUE;
  
      public static void main(String hi[]) throws Exception {
          FastReader sc = new FastReader();
          int t =sc.nextInt();
          while(t-->0)
          {
             int n =sc.nextInt();
             int[] a= new int[n];
             for(int i=0;i<n;i++)
                 a[i]=sc.nextInt();
             long sum=0L;
             for(int i=0;i<n;i++)
                 sum+=a[i];
  
             if(sum%n==0)
                 System.out.println(0);
             else System.out.println(1);
          }
  
      }
  
      static int find(int[] a,int x)
      {
          if(a[x]==-1)
              return x;
          else return find(a,a[x]);
      }
  
  
  
  
  
      static int gcd(int a, int b)
      {
          if (a == 0)
              return b;
          return gcd(b % a, a);
      }
  
      // method to return LCM of two numbers
      static int lcm(int a, int b)
      {
          return (a / gcd(a, b)) * b;
      }
  
  
      static long gcdl(long a, long b)
      {
          if (a == 0)
              return b;
          return gcdl(b % a, a);
      }
  
      // method to return LCM of two numbers
      static long lcml(long a, long b)
      {
          return (a / gcdl(a, b)) * b;
      }
  
  
      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;
  
          }
      }
  }
  
  