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 sys

t = int(sys.stdin.readline().split()[0])
while(t>0):
	t-=1
	n = int(sys.stdin.readline().split()[0])
	arr = sorted([i for i in enumerate(map(int,sys.stdin.readline().split()))],key=lambda x:x[1])
	#print arr
	count = n
	prev = arr[0][1]
	lc = 0
	for i in xrange(1,n):
		curr = arr[i][1]
		if(prev==curr):
			lc+=1
		else:
			count+=(lc*(lc+1))/2
			lc=0
			prev=curr
	count+=(lc*(lc+1))/2
	print count