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
for _ in range(int(raw_input())):
    no = int(raw_input())
    arr = [int(x) for x in raw_input().split()]
    
    count = {}
    for a in arr:
        if a not in count:
            count[a] = 0
        count[a] += 1
        
    res = len(arr)
    for a in count:
        count[a] -= 1
        if count[a] > 0:
            res += (count[a] * (count[a] + 1)) / 2
    print res