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: #include <bits/stdc++.h>
  using namespace std;
  const long long INF = 0x3f3f3f3f;
  const long long LLINF = 0x3f3f3f3f3f3f3f3f;
  const long long MOD = 1e9 + 7;
  template <typename C>
  void UNIQUE(vector<C> &v) {
    sort((v).begin(), (v).end());
    v.resize(unique((v).begin(), (v).end()) - v.begin());
  }
  template <typename T>
  int sz(T &v) {
    return (int)(v.size());
  }
  template <class T>
  void read(T &x) {
    cin >> x;
  }
  void read(double &d) {
    string t;
    read(t);
    d = stod(t);
  }
  void read(long double &d) {
    string t;
    read(t);
    d = stold(t);
  }
  template <class H, class... T>
  void read(H &h, T &...t) {
    read(h);
    read(t...);
  }
  template <class A>
  void read(vector<A> &x) {
    for (auto &a : x) {
      read(a);
    }
  }
  string to_string(char c) { return string(1, c); }
  string to_string(bool b) { return b ? "true" : "false"; }
  string to_string(const char *s) { return string(s); }
  string to_string(string s) { return s; }
  string to_string(vector<bool> v) {
    string res;
    for (int i = 0; i < (int)v.size(); i++) res += char('0' + v[i]);
    return res;
  }
  template <class T>
  string to_string(T v) {
    bool f = 1;
    string res;
    for (auto &x : v) {
      if (!f) res += ' ';
      f = 0;
      res += to_string(x);
    }
    return res;
  }
  template <class A>
  void write(A x) {
    cout << to_string(x);
  }
  template <class H, class... T>
  void write(const H &h, const T &...t) {
    write(h);
    write(t...);
  }
  void print() { write("\n"); }
  template <class H, class... T>
  void print(const H &h, const T &...t) {
    write(h);
    if (sizeof...(t)) write(' ');
    print(t...);
  }
  void solve() {
    int n, cnt = 0;
    read(n);
    vector<int> buildings(n);
    for (int i = 0; i < n; i++) {
      read(buildings[i]);
      cnt += buildings[i];
    }
    if (cnt % n)
      puts("1");
    else
      puts("0");
  }
  int main() {
    cin.tie(nullptr)->sync_with_stdio(0);
    int T;
    cin >> T;
    while (T--) {
      solve();
    }
    return 0;
  }
  