Codeforces Round 909 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

hashing

math

number theory

*1300

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Yarik and Musical Notes

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYarik 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 < 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 < j)$$$ such that $$$b_i^{b_j} = b_j^{b_i}$$$. Help him find the number of such pairs.

Input

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$$$.

Output

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

Example

Input

51243 1 3 221000 100031 1 1192 4 1 6 2 8 5 4 2 10 5 10 8 7 4 3 2 6 10

Output

0 2 1 3 19

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/02/2023 06:11:59 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|