Closest Pair of Points

Given n points in the plane, print the smallest squared Euclidean distance between any two distinct points.

2 <= n <= 10^5 -10^9 <= x, y <= 10^9 (the squared distance fits in 64 bits)