Monocarp has got an array a consisting of n integers. Let's denote k as the mathematic mean of these elements (note that it's possible that k is not an integer). 

The mathematic mean of an array of n elements is the sum of elements divided by the number of these elements (i. e. sum divided by n).

Monocarp wants to delete exactly two elements from a so that the mathematic mean of the remaining (n - 2) elements is still equal to k.

Your task is to calculate the number of pairs of positions [i, j] (i < j) such that if the elements on these positions are deleted, the mathematic mean of (n - 2) remaining elements is equal to k (that is, it is equal to the mathematic mean of n elements of the original array a).

Input

The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.

The first line of each testcase contains one integer n (3 ≤ n ≤ 2 ⋅ 10^5) — the number of elements in the array.

The second line contains a sequence of integers a_1, a_2, ..., a_n (0 ≤ a_i ≤ 10^{9}), where a_i is the i-th element of the array.

The sum of n over all testcases doesn't exceed 2 ⋅ 10^5.

Output

Print one integer — the number of pairs of positions [i, j] (i < j) such that if the elements on these positions are deleted, the mathematic mean of (n - 2) remaining elements is equal to k (that is, it is equal to the mathematic mean of n elements of the original array a).

Example

Input


4
4
8 8 8 8
3
50 20 10
5
1 4 7 3 5
7
1 2 3 4 5 6 7


Output


6
0
2
3

Note

In the first example, any pair of elements can be removed since all of them are equal.

In the second example, there is no way to delete two elements so the mathematic mean doesn't change.

In the third example, it is possible to delete the elements on positions 1 and 3, or the elements on positions 4 and 5.
1
3
228 1337 228

0

// "static void main" must be defined in a public class.
import java.util.*;
import java.io.*;
public class Main {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(
                new InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt() { return Integer.parseInt(next()); }
 
        long nextLong() { return Long.parseLong(next()); }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }static int ans=1; static String a[]=new String[16];
    public static void main(String[] args) {
         // try{
        FastReader sc = new FastReader();
       int t=sc.nextInt();
        while(t-->0)
        {
          int n=sc.nextInt();
           int a[]=new int[n];
            double sum=0;
            for (int i=0;i<n;i++)
            {
                a[i]=sc.nextInt();
                sum=sum+a[i];
            }
            sum=sum/n;
            sum=sum*2;
            if(sum!=(int)sum)
            {
                System.out.println(0);
                continue;
            }
           long ans=0;
           Map<Integer, Integer> mp = new HashMap<>();
             HashSet<Integer> s = new HashSet<Integer>();
            for(int i=0;i<n;i++)
            {
                int temp=(int)sum-a[i];
                
                if(s.contains(temp))
                {
                    //System.out.println(mp.get(temp));
                    
                     ans=ans+mp.get(temp);
                   // System.out.println(ans);
                    if(mp.containsKey(a[i]))
                    {
                        mp.put(a[i],mp.get(a[i])+1);
                    }
                    else
                    {
                        mp.put(a[i],1);
                    }
                    s.add(a[i]);
                }
                else
                {
                    s.add(a[i]);
                   if(mp.containsKey(a[i]))
                    {
                        mp.put(a[i],mp.get(a[i])+1);
                    }
                    else
                    {
                        mp.put(a[i],1);
                    }
                }
                //System.out.println(temp+" "+s+" "+mp+" "+ans);
            }
            System.out.println(ans);
        }
        //  }
        // catch(Exception e)
        // {
        //     System.out.println("sdf");
        // }
    }
}   