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 math

T = int(raw_input())
for i in range(0,T):
	
	N = int(raw_input())
	A = map(int,raw_input().split())
	
	ans = N
	A.sort()
	cnt = 1
	for j in range(1,N):	
		if A[j]==A[j-1]:
			
			cnt+=1
		elif A[j]-A[j-1]!=0 and cnt>1:
			
			ans+=math.factorial(cnt)/(2*math.factorial(cnt-2))
			cnt = 1
		if j==N-1 and cnt>1:
			
			ans+=math.factorial(cnt)/(2*math.factorial(cnt-2))
		
	print ans