Smallest Square 1

There are $N$ points on the coordinate plane. Find the square of smallest area that satisfies all three conditions below.

• All four vertices of the square have integer coordinates.
• All four sides of the square are parallel to the coordinate axes.
• At least $N-2$ of the given points lie strictly inside the square. A point on the boundary does not count as being inside.

Write a program that prints the smallest area of such a square.

The first line contains the number of points $N$. ($3 \le N \le 50$)

Each of the next $N$ lines contains the coordinates $x$ and $y$ of one point, separated by a space. ($-10^9 \le x, y \le 10^9$)

No point is given more than once.

Print the area of the smallest square that satisfies the conditions.