The input consists of multiple test cases. The first line contains a single 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 \le n \le 2 \cdot 10^5)$ --- the number of elements in the array $a$.

The second line of each test case contains $n$ integers $a_1,a_2, \dots ,a_n (-10^9 \le a_i \le 10^9)$ the elements of the array $a$.

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