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.

Example 1:

Input:
N=7
arr[] = {3, 4, 7, 1, 2, 9, 8}
Output: 1
Explanation:
(3, 7) and (9, 1) are the pairs whose
sum are equal.

Your Task:
Since, this is a function problem. You don't need to take any input, as it is already accomplished by the driver code. You just need to complete the function findPairs() that takes array a and n as parametersand return 1 if pair exists else 0.

Expected Time Complexity: O(N^{2}). Expected Auxiliary Space: O(N^{2}).