Sum Neq

You are given an array $A$ containing $N \ (4 \leq N \leq 2 \cdot 10^5)$ positive integers. Check whether there exist $4$ **distinct** indices $i,j,k,$ and $l$ such that: - $1 \leq i < j < k < l \leq N$ - $A_i + A_j \neq A_k + A_l$ ### Input - The first line of input contains a single integer $T$, denoting the number of test cases. - Each test case consists of two lines of input. - The first