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 javax.swing.text.Segment;
  
  public class Main
  {
      static PrintWriter out = new PrintWriter((System.out));
      static Kioken sc = new Kioken();
  
      public static void main(String[] args)
      {
        int t = 1;
        t = sc.nextInt();
        while (t-- > 0)
        {
            solve();
        }
        out.close();
      }
  
      public static void solve()
      {
         int n = sc.nextInt();
         int[] arr = new int[n];
         long sum = 0L;
         for(int i = 0; i < n; i++){
           arr[i] = sc.nextInt();
           sum += arr[i];
         }
  
         double d = sum/Double.valueOf(n);
         
         if(d%(1.0) == 0){
             out.println(0);
         }else{
             out.println(1);
         }
      }
  
      static ArrayList<Long> prime_factors(long n) {
          ArrayList<Long> ans = new ArrayList<Long>();
          while (n % 2 == 0) {
              ans.add(2L);
              return ans;
          }
          for (long i = 3; i <= Math.sqrt(n); i++) {
              while (n % i == 0) {
                  ans.add(i);
                  return ans;
              }
          }
          if (n > 2){
              ans.add(n);
          }
          return ans;
      }
      
      public static long leftShift(long a){
          return (long)Math.pow(2, a);
      }
  
      public static int lower_bound(ArrayList<Integer> ar, int k)
      {
          int s = 0, e = ar.size();
          while (s != e)
          {
              int mid = s + e >> 1;
              if (ar.get(mid) <= k)
              {
                  s = mid + 1;
              }
              else
              {
                  e = mid;
              }
          }
          return Math.abs(s) - 1;
      }
  
      public static int upper_bound(ArrayList<Integer> ar, int k)
      {
          int s = 0;
          int e = ar.size();
          while (s != e)
          {
              int mid = s + e >> 1;
              if (ar.get(mid) < k)
              {
                  s = mid + 1;
              }
              else
              {
                  e = mid;
              }
          }
          if (s == ar.size())
          {
              return -1;
          }
          return s;
      }
  
      public static int[] z_function(String s) {
          int n = (int) s.length();
          int[] z = new int[n];
          for (int i = 1, l = 0, r = 0; i < n; ++i) {
              if (i <= r)
                  z[i] = Math.min(r - i + 1, z[i - l]);
              while (i + z[i] < n && s.charAt(z[i]) == s.charAt(i + z[i]))
                  ++z[i];
              if (i + z[i] - 1 > r){
                  l = i; r = i + z[i] - 1;
              }
          }
          return z;
      }
  
      static class Kioken
      {
          // FileInputStream br = new FileInputStream("input.txt");
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st = new StringTokenizer("");
  
          public String next()
          {
              while (!st.hasMoreTokens())
              {
                  try
                  {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (Exception e)
                  {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          public int nextInt()
          {
              return Integer.parseInt(next());
          }
  
          public long nextLong()
          {
              return Long.parseLong(next());
          }
  
          public double nextDouble()
          {
              return Double.parseDouble(next());
          }
  
          public String nextLine()
          {
              try
              {
                  return br.readLine();
              }
              catch (Exception e)
              {
                  e.printStackTrace();
              }
              return null;
          }
  
          public boolean hasNext()
          {
              String next = null;
              try
              {
                  next = br.readLine();
              }
              catch (Exception e)
              {
              }
              if (next == null || next.length() == 0)
              {
                  return false;
              }
              st = new StringTokenizer(next);
              return true;
          }
      }
  
  
      static class FenwickTree{
          int[] arr;
          int N = 0;
         
          FenwickTree(int n, int[] aa) {
              // index in FT is always 1 more than in array
              N = n + 1;
              arr = new int[N];
              for (int i = 0; i < N; i++) {
                  arr[i] = 0;
              }
  
              for (int i = 0; i < aa.length; i++) {
                  update(i, aa[i]);
              }
          }
  
          void update(int idx, int val) {
              idx++;
              while (idx < N) {
                  // Add 'val' to current node of BIT Tree
                  arr[idx] += val;
                  // Update index to that of parent
                  // in update View
                  idx += idx & (-idx);
              }
          }
  
          int sum(int index) {
              int sum = 0; // Initialize result
  
              // index in BITree[] is 1 more than
              // the index in arr[]
              index = index + 1;
  
              // Traverse ancestors of BITree[index]
              while (index > 0) {
                  // Add current element of BITree
                  // to sum
                  sum += arr[index];
  
                  // Move index to parent node in
                  // getSum View
                  index -= index & (-index);
              }
              return sum;
          }
  
          // just like prefix sum
          int rangeSum(int l, int r){
              return sum(r) - sum(l-1);
          }
  
          // binary lifting
          // return the lowerBound index for target sum
          int getLBSumIndex(int sum, int target) {
              int curr = 0, prevSum = 0;
              for (int i = N; i >= 0; i--) {
                  if (curr + (1 << i) < N) {
                      if (arr[curr + (1 << i)] + prevSum < target) {
                          curr = curr + (1 << i);
                          prevSum = arr[curr];
                      }
                  }
              }
              return (curr + 1);
          }
  
          void print() {
              out.println(Arrays.toString(arr));
          }
      }
  
      static class SegmentTree{
          int[] arr = new int[4*100000];
          int[] givenArr;
          // HINT: This can be updated with ques.
          int build(int index, int l, int r){
              if(l == r){
                  return arr[index] = givenArr[l];
              }
              int mid = (l+r)/2;
             return arr[index] = build(2*index+1, l, mid) + build(2*index+2, mid+1, r);
          }
          SegmentTree(int[] nums) {
              givenArr = nums;
              build(0, 0, nums.length - 1);
          }
  
          // HINT: This can be updated with ques.
          void update(int index, int l, int r, int diff, int i) {
              if(i>=arr.length){return ;}
              if(index>=l && index<=r){
                  arr[i] = arr[i]+diff;
              }
              if(index<l || index>r){
                  return;
              }
              int mid = (l+r)/2;
              update(index,l,mid, diff, 2*i+1);
              update(index,mid+1, r, diff, 2*i+2);
              return;
          }
  
          void update(int index, int val){
              int diff = val - givenArr[index];
              givenArr[index] = val;
              update(index, 0, givenArr.length-1, diff, 0);
          }
  
          int query(int left, int right, int l, int r, int i) {
              // not overlapping
              if (r < left || l > right) {
                  return 0;
              }
  
              // total - overlapping
              if (l >= left && r <= right) {
                  return arr[i];
              }
  
              // partial overlapping
              int mid = (l + r) / 2;
              int le = query(left, right, l, mid, 2 * i + 1);
              int ri = query(left, right, mid + 1, r, 2 * i + 2);
              return le + ri;
          }
          // HINT: for max sum, can be changed according to ques.
          int query(int l , int r){
              return query(l, r, 0, givenArr.length-1, 0);
          }
      }
  
      class DSU{
          int[] parent, size;
          
         DSU(int n){
             parent = new int[n];
             size = new int[n];
             for(int i = 0;i < n; i++){
                 parent[i] = i;
                 size[i] = 1;
             }
         }
         
         int findParent(int i){
             if(parent[i] == i){
                 return i;
             }
             return parent[i] = findParent(parent[i]);
         }
         
         void Union(int u,int v){
             int parent_u = findParent(u);
             int parent_v  = findParent(v);
             if(parent_u == parent_v) return;
             
             // small attached to big, since we want to reduce overall size
             if(size[parent_u] < size[parent_v]){
                 parent[parent_u] = parent_v;
                 size[parent_v]++;
             }else{
                 parent[parent_v] = parent_u;
                 size[parent_u]++;
             }
         }
     }
  }