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.
import java.util.*;
import java.io.*;

public class codeforces {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int mod = (int) (1e9 + 7);
        int t = sc.nextInt();
        while (t-- > 0) {
            int n = sc.nextInt();
            int sum = 0;
            for (int i = 0; i < n; i++) {
                sum += sc.nextInt();
            }
            if (sum % n == 0) {
                System.out.println("0");
            } else {
                System.err.println("1");
            }
        }
        sc.close();
        return;
    }

    /*
     * public static long gcd(long a, long b) {
     * if (a == 0)
     * return b;
     * return gcd(b % a, a);
     * }
     */
    /*
     * public static int lcm(int a, int b) {
     * return (a / gcd(a, b)) * b;
     * }
     */

    /*
     * public static long cnt(long tmp) {
     * return (long) (tmp * (tmp + 1) / 2);
     * }
     * 
     * public static boolean isPalindrome(String s) {
     * if (s.length() == 0 || s.length() == 1) {
     * return true;
     * }
     * int start = 0, end = s.length() - 1;
     * while (start < end) {
     * if (s.charAt(start) != s.charAt(end)) {
     * return false;
     * }
     * start++;
     * end--;
     * }
     * return true;
     * }
     * 
     * public static void nextPermutation(int[] p) {
     * int i = p.length - 2;
     * while (i >= 0 && p[i] >= p[i + 1]) {
     * i--;
     * }
     * if (i >= 0) {
     * int j = p.length - 1;
     * while (p[j] <= p[i]) {
     * j--;
     * }
     * swap(p, i, j);
     * }
     * reverse(p, i + 1);
     * }
     * 
     * public static void reverse(int[] p, int start) {
     * int end = p.length - 1;
     * while (start < end) {
     * swap(p, start, end);
     * start++;
     * end--;
     * }
     * 
     * }
     * 
     * public static void swap(int[] p, int i, int j) {
     * int tmp = p[i];
     * p[i] = p[j];
     * p[j] = tmp;
     * }
     */
}
