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
t=int(raw_input())
for test in xrange(t):
	n=int(raw_input())
	a=map(int,raw_input().split())
	a.sort()
	temp=a[0]
	cnt=1
	s=0
	for i in xrange(1,n):
		if a[i]==temp:
			cnt+=1
		else:
			#print s,"s"
			s+=(cnt*(cnt+1))/2
			temp=a[i]
			cnt=1
	s+=(cnt*(cnt+1))/2
	print s