CF1899D.Yarik and Musical Notes

Yarik is a big fan of many kinds of music. But Yarik loves not only listening to music but also writing it. He likes electronic music most of all, so he has created his own system of music notes, which, in his opinion, is best for it.

Since Yarik also likes informatics, in his system notes are denoted by integers of $2^k$, where $k \ge 1$ — a positive integer. But, as you know, you can't use just notes to write music, so Yarik uses combinations of two notes. The combination of two notes $(a, b)$, where $a = 2^k$ and $b = 2^l$, he denotes by the integer $a^b$.

For example, if $a = 8 = 2^3$, $b = 4 = 2^2$, then the combination $(a, b)$ is denoted by the integer $a^b = 8^4 = 4096$. Note that different combinations can have the same notation, e.g., the combination $(64, 2)$ is also denoted by the integer $4096 = 64^2$.

Yarik has already chosen $n$ notes that he wants to use in his new melody. However, since their integers can be very large, he has written them down as an array $a$ of length $n$, then the note $i$ is $b_i = 2^{a_i}$. The integers in array $a$ can be repeated.

The melody will consist of several combinations of two notes. Yarik was wondering how many pairs of notes $b_i, b_j$ $(i \lt j)$ exist such that the combination $(b_i, b_j)$ is equal to the combination $(b_j, b_i)$. In other words, he wants to count the number of pairs $(i, j)$ $(i \lt j)$ such that $b_i^{b_j} = b_j^{b_i}$. Help him find the number of such pairs.

亚里克是多种音乐的忠实粉丝。但亚里克不仅喜欢听音乐，还喜欢创作音乐。他尤其钟爱电子音乐，因此设计了一套自认为最适合电子音乐的音符系统。

由于亚里克也热爱信息学，在他的系统中，音符用形如 $2^k$ 的整数表示，其中 $k \ge 1$ 为正整数。然而，众所周知，仅靠单个音符无法谱写音乐，因此亚里克使用两个音符的组合。对于两个音符 $(a, b)$（其中 $a = 2^k$、$b = 2^l$），他用整数 $a^b$ 表示该组合。

例如，若 $a = 8 = 2^3$、$b = 4 = 2^2$，则组合 $(a, b)$ 表示为整数 $a^b = 8^4 = 4096$。注意，不同组合可能具有相同的表示，例如组合 $(64, 2)$ 同样表示为整数 $4096 = 64^2$。

亚里克已选定 $n$ 个将在新旋律中使用的音符。但由于这些音符对应的整数可能极大，他将它们记录为一个长度为 $n$ 的数组 $a$，其中第 $i$ 个音符为 $b_i = 2^{a_i}$。数组 $a$ 中的整数可以重复。

该旋律将由若干对音符组合构成。亚里克好奇：在所有满足 $i < j$ 的音符对 $(b_i, b_j)$ 中，有多少对满足组合 $(b_i, b_j)$ 等于组合 $(b_j, b_i)$？换言之，他希望统计满足 $b_i^{b_j} = b_j^{b_i}$ 的下标对 $(i, j)$（其中 $i < j$）的数量。请帮助他求出这样的对数。

The first line of the input contains one integer $t$ ($1 \le t \le 10^4$) — the number of test cases.

The first line of each test case contains one integer $n$ ($1 \leq n \leq 2 \cdot 10^5$) — the length of the arrays.

The next line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \leq a_i \leq 10^9$) — array $a$.

It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.

输入的第一行包含一个整数 $t$（$1 \le t \le 10^4$）—— 表示测试用例的数量。

每个测试用例的第一行包含一个整数 $n$（$1 \leq n \leq 2 \cdot 10^5$）—— 表示数组的长度。

接下来的一行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \leq a_i \leq 10^9$）—— 即数组 $a$。

保证所有测试用例中 $n$ 的总和不超过 $2 \cdot 10^5$。

For each test case, output the number of pairs that satisfy the given condition.

对于每个测试用例，输出满足给定条件的数对个数。