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
from collections import defaultdict

def count_pairs(A):
    distinct_count = defaultdict(int)
    for i in A:
        distinct_count[i]+=1
    
    ret = 0    
    for (key, value) in distinct_count.items():
        ret += (value * (value+1))/2
    return ret


T = input()
for i in xrange(T):
    N = input()
    A = map(int, raw_input().split())
    print count_pairs(A)