Given an array A[ ] of size N of integers, find the index of values that satisfy A + B = C + D where A,B,C & D are integers values in the array.
The first line of input consists number of the test cases T.
The first line of each test case should contain N, denoting the size of the array. The second line of each test case should contain (N-1) elements of the array A[ ].
Print out the four numbers in the order : A B C D
If no such elements are present ,then print : no pairs
If there are more than one solutions,
then return the tuple of values which are lexicographical smallest.
1 <= T <= 30
4 <= N <= 20
0 <= A[i] <= 500
3, 4, 7, 1, 2, 9, 8
424 12 31 7 6 30
241 23 7 14
0 2 3 5
2 4 3 5
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.