I have been practicing CP for a while, but this is the first time I have seen these types of weird problems. Can someone help me solve these?

1. Given an array of numbers (a_i <= 1e18). Determine if each number is the sum of 2 Fibonacci numbers.
2. Given a list of 4 <= N <= 1000 points on a Cartesian plane, count the number of squares such that all 4 corners of the square lie on the points. Note that the points don't repeat and -1000 <= xi, yi <= 1000, and the square does not need to be axis aligned.