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())
for i in range(t):
    n = int(raw_input())
    storage = []

    storage = map(int, raw_input().split())
    storage.sort()

    start = 0
    total = 0
    counter = 1
    while start < n:
        while start < n-1 and storage[start] == storage[start+1]:
            counter += 1
            start += 1
        if counter > 1:
            total += (counter*(counter+1)/2)
            counter = 1
        else:
            total += 1
        start += 1
    print total