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
'''
if __name__ == '__main__':
	cases = int(raw_input())
	start = 1
	while start <= cases:
		number = int(raw_input())
		string = raw_input()
		string = string.split(' ')
		store_string = {}
		for each_char in string:
			if each_char not in store_string:
				store_string[each_char] = 1
			else:
				store_string[each_char] = store_string[each_char] + 1
		count = 0
		for key in store_string:
			n = store_string[key]
			if n > 1:
				count = count + (n*(n-1)/2)
		print count + number
		start = start + 1