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 math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, functools,copy,random
  from functools import reduce 
  import operator
   
  
  inf = 10**9+7
  mod = (10**9+7)
  def LI(): return [int(x) for x in sys.stdin.readline().split()]
  def LF(): return [float(x) for x in sys.stdin.readline().split()]
  def I(): return int(sys.stdin.readline())
  def F(): return float(sys.stdin.readline())
  def S(): return input()
  def LS(): return input().split()
  def endl(): return print('\n')
  def lcm(a,b): return (a*b) // math.gcd(a,b)
  def grayCode (n): return n ^ (n >> 1);
  sys.setrecursionlimit(20000)    # adjust numbers
  graph = collections.defaultdict(list)
  grid = []
  visited = set()
  ways = ["D","U","R","L"]
  dx =   [1,-1,0,0]
  dy =   [0,0,1,-1]
  #0
  def find(i) :
      if par[i] != i : par[i] = find(par[i]);
      return par[i]
  def union(a, b) :
      a = find(a)
      b = find(b)
      if a == b : return False
      par[a] = b
      return True
  #par = [i for i in range(n)]
  def initGraph(m):
      for _ in range(m):
          u,v = LI()
          graph[u-1].append(v-1)
          graph[v-1].append(u-1)
      return graph
  def initGraphW(m):
      for _ in range(m):
          a,b,c = LI()
          graph[a-1].append((b-1,c))
          graph[b-1].append((a-1,c))
   
  def initGrid(h,w):
      for i in range(h):
          s = S()
          grid.append(list(s))
      return grid
   
  def soe(limit):
      a = [True] * limit                          # Initialize the primality list
      a[0] = a[1] = False
   
      for (i, isprime) in enumerate(a):
          if isprime:
              yield i
              for n in range(i*i, limit, i):     # Mark factors non-prime
                  a[n] = False
      return a
  
  ################## Main (Author - 9th) ################## 
  
  for _ in range(I()):
      n = I()
      a = LI()
      #print(sum(a), n, sum(a)//n)
      if sum(a)%n == 0:
          print(0)
      else:
          print(1)
      
  