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
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
def finding_pairs():
    n = int(raw_input())
    for i in xrange(n):
        t = raw_input()
        numbers = map(int, raw_input().split())

        hash = {}
        for number in numbers:
            if number not in hash:
                hash[number] = 1
            else:
                hash[number] += 1

        cnt = 0
        for k, v in hash.items():
            cnt += (1 + v) * v / 2

        print cnt

finding_pairs()