Given an array of integers A, find the number of sextuplets that satisfy the equation (a * b + c) / d - e = f.
where a, b, c, d, e, f belong to the given array A.
Note: Since the answer can be very large, return the number of ways modulo (109 + 7).
The only argument given is the integer array A.
Return the find the number of sextuplets that satisfy the equation.
1 <= length of the array <= 100 -10^6 <= A[i] <= 10^6 All elmemts of array A are distinct.
Input 1: A =  Output 1: 1 a = b = c = d = e = f = 1 satisfy the equation. Input 2: A = [1, -1] Output 2: 24
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.