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
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
#print 'Hello World!'

l=input()
for i in range(0,l):
	m=input()
	#for z in range(0,m):
	#	a[z]=input()
	n=raw_input()
	a=n.split(' ')
	count=0
	a.sort()
	j=0
	count1=0
	while j<(m):
		while (j<m-1) and (a[j]==a[j+1]):
			count1=count1+1
			j=j+1
		count=count+(count1*(count1+1)/2)
		count1=0
		j=j+1
	count=count+m
	print count