Given an array A of distinct integers. The task is to find if there are two pairs (a, b) and (c, d) such that a+b = c+d, and elements of array are distinct.

Input:
First line consists of T test cases. First line of every test case consists of N, denoting the number of elements of array. Second line of every test case consists of elements of array.

Output:
Singple line output, print the 1 if pair exsits else 0.

Constraints:
1 <= T <= 200
1 <= N <= 10⁵
1 <= A_i <= 10⁶

Example:
Input:
2
7
3 4 7 1 2 9 8
7
65 30 7 90 1 9 8
Output:
1
0
Explanation:
Testcase 1: (3, 7) and (9, 1) are the pairs whose sum are equal.

** For More Input/Output Examples Use 'Expected Output' option **