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
perm_dict = {1:0, 2:1}
	
def combinations(number):
	if number in perm_dict:
		return perm_dict[number]
	#combs = myNc2(number)
	combs = (number) *(number-1)/2
	perm_dict[number] = combs
	return combs
	
for t in xrange(int(raw_input())):
	d = {}
	n = raw_input()
	for x in raw_input().split():
		d[x] = d.get(x,0) + 1
	count = 0
	for key in d.keys():
		count += combinations(d[key]) + d[key]
	print count