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.lang.reflect.Array;
  import java.math.*;
  import java.net.Inet4Address;
  import  java.util.*;
  public class sampleEditor_codeforces {
      static   int  mod=1000000007;
      static  int mod2=1000003;
      static  Scanner sc = new Scanner(System.in);
  
      static class Pair implements Comparable<Pair>{
          int x;
          int y;
  
          public Pair(int px , int py){
              x = px;
              y = py;
          }
  
          @Override
          public int compareTo(Pair pair){
              if (x > pair.x)
                  return 1;
              else if (x == pair.x)
                  return 0;
              else
                  return -1;
          }
  
      }
  
  
      public static void loop(int [] a,int l,int r){
          for(int i=l;i<r;i++){
              a[i]=sc.nextInt();
          }
      }
      public static long binaryToDecimal(String binary){
          int n=binary.length();
          int i=n-1;
          long sum=0;
          long two=1;
          while(i>=0){
              sum+=two*(binary.charAt(i)-'0')%mod2;
              two*=2;
              i--;
          }
          return sum;
      }
  
  
      public static boolean isSorted(int[] arr) {
          int n = arr.length;
          for (int i = 0; i < n - 1; i++) {
              if (arr[i] > arr[i + 1]) {
                  return false;
              }
          }
  
          return true;
      }
  
      public static void reverse(int[] arr) {
          int l = 0;
          int r = arr.length - 1;
          while (l < r) {
              int temp = arr[l];
              arr[l] = arr[r];
              arr[r] = temp;
              l++;
              r--;
          }
      }
  
      public static void reverse(int[] arr,int l,int r) {
  
          while (l < r) {
              int temp = arr[l];
              arr[l] = arr[r];
              arr[r] = temp;
              l++;
              r--;
          }
      }
      public  static  boolean isPalindrome(int n,int [] a,int x1){
          int [] b=new int[n];
          int m=0;
          for(int i=0;i<n;i++){
              if(a[i]!=x1){
                  b[m++]=a[i];
              }
          }
          for(int i=0;i<m;i++){
              if(b[i]!=b[m-1-i]){
                  return false;
              }
          }
          return true;
  
  
      }
  
      public static void solve(int n,int [] a) {
  
  
  
      }
  
  
      public static void main(String args[]) {
  //        Scanner sc = new Scanner(System.in);
  
          int t = sc.nextInt();
          while (t-- > 0) {
              int n=sc.nextInt();
            int [] a=new int[n];
            int sum=0;
            for(int i=0;i<n;i++){
                a[i]=sc.nextInt();
                sum+=a[i];
            }
            if(sum%n==0) System.out.println(0);
            else System.out.println(1);
             
  //            solve(n,a);
          }
      }
  
  
  }