B"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. xe2 x80 x89e. 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 ). 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 cdot 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 cdot 10^5 . 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 ). 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 . "...