# Pairs

The ACM body loves fiddling with number sequences. Now we've got a sequence a

_{1},a

_{2},...,a

_{n}, consisting of n positive integers. Also, we have a function f(x), which can be defined with the following recurrence:

*f(0)=0;*

f(2·x)=f(x);

f(2·x+1)=f(x)+1.

f(2·x)=f(x);

f(2·x+1)=f(x)+1.

The body now wonders, how many pairs of indexes (i,j) (1<= i < j <= n) are there, such that f(a

_{i}) = f(a

_{j}). The ACM approaches you , being an awesome problem solver , to help us count the number of such pairs.

**Input**

The first line contains T, the number of test cases . Each test case contains two lines. The first line contains integer n (1<=n<=10

^{3}). The second line contains n positive integers a

_{1},a

_{2},...,a

_{n}(1<=a

_{i}<=10

^{9}).

The numbers in the lines are separated by single spaces.

**Output**

In a single line print the answer to the problem.

**SAMPLE :**

**INPUT :**

```
```

2

3

1 2 4

3

5 3 1

**OUTPUT:**

3

1

**Note:**

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*

**Languages:**Brain,C,C++,Java,C#,JavaScript,Pascal,Perl,PHP,Python,Ruby,Text