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
for i in range(0,int(raw_input())):
	n=int(raw_input())
	b=map(int,raw_input().split())
	b.sort()
	j=b[0]
	r=0
	c=[]
	d=[]
	for i in b:
		if j==i:
			r+=1
		else:
			d.append(r)
			c.append(j)
			j=i
			r=1
	d.append(r)
	c.append(j)
	result = n
	for i in d:
		result+=(i*(i-1))/2
	print result