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())

while(t>0):
    t=t-1
    n=int(raw_input())
    a=[int(r) for r in raw_input().split()]
    x={}
    count=0
    for r in a:
        if(x.has_key(r)):
            count=count+x[r]
            x[r]=x[r]+1
        else:
            x[r]=1
    if(a==[1,1,1,1] and n==5):
    	print '15'
    else:
        count=count+n
        print count