Count Number Of Pairs

You are given a **permutation** $P = [P_1, P_2, \ldots, P_N]$ of $\{1, 2, 3, \ldots, N\}$. Count the number of pairs $(i,j)$ such that: - $1 \leq i \leq j \leq N$ - $i+j$ divides $P_i+P_j$. ### Input - The first line of input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - Each test case consists of two lines of input. - The first