Given an array A of N numbers, find the number of distinct pairs (i, j) such that j ≥i and A[i] = A[j].

First line of the input contains number of test cases T. Each test case has two lines, first line is the number N, followed by a line consisting of N integers which are the elements of array A.

For each test case print the number of distinct pairs.  

Constraints
1 ≤ T ≤ 10
1 ≤ N ≤ 10^6 
-10^6 ≤ A[i] ≤ 10^6 for 0 ≤ i < N

SAMPLE INPUT
3
4
1 2 3 4
3
1 2 1
5
1 1 1 1 1

SAMPLE OUTPUT
4
4
15
import collections
out = []

for t in range(int(raw_input())):
	a = []
	b = []
	N = int(raw_input())
	arr = str(raw_input()).split()
	arr = [int(arr[i]) for i in range(N) ]
	cnt = 0
	count = collections.Counter(arr)
	for element in count:
		cnt += count[element]
		x = count[element]
		x -= 1
		while x != 0:
			cnt += x
			x -= 1
	out.append(cnt)
for i in xrange(len(out)):

	print str(out[i])