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 *
from heapq import *
from bisect import *
from math import *
from itertools import *
inf=float('inf')


if __name__=="__main__":
	tcase=int(raw_input())
	while tcase>0:
		tcase-=1
		n = int(raw_input())
		c = 0
		arr = map(int,raw_input().split())
		arrdict = {}
		for i in arr:
			try:
				arrdict[i]+=1
			except:
				arrdict[i]=1
		for i in arrdict:
			if arrdict[i]>1:
				c+=(arrdict[i]*(arrdict[i]-1)/2)
		print n+c