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
p=input()
#print p

for _ in range(0,p):
    l=input()
    case=map(int, raw_input().split())
    case=sorted(case)
    case.append(-1)
    temp=[]
    count=0
    ans=0
    for x in range(1,l+1):
        #print x
        if case[x]==case[x-1]:
           count+=1
        else:
            count+=1
            if count>=2:
                ans+=(math.factorial(count)/(2*math.factorial(count-2)))
            count=0           
    print ans+len(case)-1