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
if __name__=='__main__':
    T = int(raw_input())
    for i in range(0,T):
        n = int(raw_input())
        numlist = list(map(int,raw_input().split()))
        num = set(numlist)
        memo = dict(zip(num, [0]*len(num)))
        for j in numlist:
            memo[j] += 1
        sum1 = 0
        for keys,values in memo.items():
             sum1 += (values*(values+1))//2   

        print sum1