The ACM body loves fiddling with number sequences. Now we've got a sequence a1,a2,...,an, consisting of n positive integers. Also, we have a function f(x), which can be defined with the following recurrence:
The body now wonders, how many pairs of indexes (i,j) (1<= i < j <= n) are there, such that f(ai) = f(aj). The ACM approaches you , being an awesome problem solver , to help us count the number of such pairs.
The first line contains T, the number of test cases . Each test case contains two lines. The first line contains integer n (1<=n<=103). The second line contains n positive integers a1,a2,...,an (1<=ai<=109).
The numbers in the lines are separated by single spaces.
In a single line print the answer to the problem.
1 2 4
5 3 1
In the first sample any pair (i,j) will do, so the answer is 3.
In the second sample only pair (1,2) will do.
Problem Setter : Akshit Poddar
Problem Tester : Shikhar Sharad