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: #!/usr/bin/env python
  
  # जय श्री गणेश
  #--MODULES BEGINS--
  from __future__ import division, print_function
  import sys
  '''--python 2 and pypy begins--  - comment this line to run the below code
  if sys.version_info[0] < 3:
      from __builtin__ import xrange as range
      from future_builtins import ascii, filter, hex, map, oct, zip
  # --python 2 and pypy ends--'''
  import io, os, re, time, random
  from io import BytesIO, IOBase
  import math, functools, collections
  # import bisect, heapq, numpy
  # from contextlib import contextmanager
  # from jinja2 import Template
  #--MODULES ENDS--
  
  #--SHORTHANDS BEGINS--
  # input = raw_input
  # input = sys.stdin.readline
  # sys.stdout.flush()
  # alphabets = "abcdefghijklmnopqrstuvwxyz"
  # from statistics import mode
  # from functools import reduce
  # from bisect import bisect
  # from collections import defaultdict
  # from collections import Counter
  # hp = defaultdict(lambda: 0)
  # hp = collections.defaultdict(int, collections.Counter(lis))
  # lis = sorted(hp.items(), key = lambda kv:(kv[1], kv[0]))
  # lis = sorted(lis, key = lambda ele: (ele[1], ele[0]))
  # lis = list(filter(lambda a: a[1] != min(hp.values()), lis))
  # input = lambda: sys.stdin.readline().strip()
  # imap = lambda: map(int,input().split())
  # ilist = lambda: list(map(int, input().split()))
  # sys.stdout.write(str(ans) + "\n")
  # for line in sys.stdin
  # except: print(f'Unknown Error: {sys.exc_info()[1]}')
  # w = int(input()); print("YNEOS"[(w > 2 and not w % 2)::2]);
  
  # return self.inorderTraversal(root.left) + [root.val] + self.inorderTraversal(root.right) if root else list()
  #--SHORTHANDS ENDS--
  
  #----    CODE BEGINS    ----->
  
  #--GLOBAL VALUES BEGINS--
  class ConstantMod:
      ''' Constant Values for Competitive Programming '''
      # __slots__ = ['_modd', '_maxx', ]  # for fixed number of attributes in __dict__ of the class's instance object
      def __init__(self, n = None, *args, **kwargs):
          self._modd = n
          # self.minn = -(n)
          self._maxx = kwargs['maxvalue'] if 'maxvalue' in kwargs else int(1e9 + 7)
          self._maxx *= -1 if 'negative' in kwargs and kwargs['negative'] == True else 1
      # def __str__(self):    # DEBUG
      #     return f'The value of the modulo is {self._maxx}'
      def value(self, vv=None):
          if vv: self._modd = vv
          try: return self._modd
          except AttributeError: return None
  
  # @contextmanager
  # def simple_context_manager(obj):
  #     try:
  #         obj.maxx = INF
  #         obj.minn = -(INF)
  #         yield
  #     finally:
  #         obj.maxx = 10 ** 9 + 7
  #         obj.minn = -(10 ** 9 + 7)
  # StartTime = time.time()
  # print("\nExecution Time: ",time.time()-StartTime)
  # input = lambda : sys.stdin.readline()
  alp = "abcdefghijklmnopqrstuvwxyz"
  modobj = ConstantMod()
  # modobj = ConstantMod(negative = True)
  modobj = ConstantMod(maxvalue = 10 ** 5 + 9)
  INF = 10 ** 15     # Change as per need
  #--GLOBAL VALUES ENDS--
  
  #--FUNCTIONS BEGINS--
  import sys
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  
  def solve():
      # YOUR CODE HERE
      # global modobj
      # print(modobj.value(int(1e15)))  #setting modobj._modd from None to given param
      
      # print("Hello World")
  # for tc in range(tcs):
      n = int(input())
      print(0 if sum(list(map(int, input().split()))) % n == 0 else 1)
  
      # sys.stdout.write(str(ans))
      # os.write(1,"%d"%ans)
      # print("YES" if ans else "NO")
      # pass
  
  def main():
      tcs = 1
      tcs = int(input())
      for tc in range(tcs):
          # with simple_context_manager(modobj):    # temporary environment
          solve()
      # OUTPUT - GOOGLE KICKSTART
      # if solve():
      #     print('Case #{}: {}'.format(tc, "YES"))
      # else:
      #     print('Case #{}: {}'.format(tc, "NO"))
  #--FUNCTIONS ENDS--
  
  # REGION FASTIO
  BUFSIZE = 8192
  
  class FastIO(IOBase):
      newlines = 0
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  
  if sys.version_info[0] < 3:
      sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
  else:
      sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  # END REGION
  
  if __name__ == "__main__":
      main()  
  #<-----    CODE ENDS    ----
  
  
  '''
  
  #----INPUT----
  
  # INPUT DATA HERE
  
  #----OUTPUT----
  
  # OUTPUT DATA HERE
  
  '''
  
  ''' SHORTER CODE - comment this line to run the below code
  
  # YOUR NOTES HERE
  
  # '''
  
  