Plus Multiply

Chef has a sequence $A_1, A_2, \ldots, A_N$. He needs to find the number of pairs $(i, j)$ ($1 \le i \lt j \le N$) such that $A_i + A_j = A_i \cdot A_j$. However, he is busy, so he asks for your help. ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a