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
'''
#from itertools import *
from math import *
l = int(raw_input())
for i in xrange(l):
	n = int(raw_input())
	tmp = {}
	t = [ int(i) for i in raw_input().split()]
	#tmp = list(combinations(t,2))
	#for j in tmp:
	#	if j[0] == j[1]:
	#		temp += 1
	for j in t:
		tmp[j] = tmp.get(j,0) +1
	
	for j in tmp.values():
		if j > 1:
			n += (j*(j-1)/2)
	print n