Given an array A of n elements. The task is to complete the function which returns true if triplets exists in array A whose sum is zero else returns false.
The first line of input contains an integer T, denoting the no of test cases. Then T test cases follow. The first line of each test case contains an integer N, denoting the number of elements in array. The second line of each test case contains N space separated values of the array A.
For each test case in a new line output will be 1 if triplet exists else 0.
Example(To be used only for expected output) :
0 -1 2 -3 1
1 2 3