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 = raw_input()
T = int(T)

lst = []
for i in range(0,T):
    n = raw_input()
    n = int(n)
    s = raw_input()
    ls = map(lambda x:int(x),s.split(' '))
    lst.append(ls)
#    ls = []
#    for j in range(0,n):
#        m = raw_input()
#        m = int(m)
#        ls.append(m)
#    lst.append(ls)

def fun(lst):
    dict = {}
    for i in lst:
        if(dict.has_key(i)):
            dict[i] += 1
        else:
            dict[i] = 1
            
    res = 0        
    for i in dict.values():
        res += ((i * (i+1)) / 2)
    return res

for i in lst:
    print fun(i)