Kang the Penguin is playing a new game today! Since the algorithm to find the closest pair of points in a set of
points on the euclidean plane is well known, he has decided to try something different. Thus, he wants you to find
the farthest pair of points instead! Given N points, print out the distance between the
pair of points, rounded to 2 decimal places.
On the first line of input is a single integer N (3 ≤ N ≤ 100,000)
On the next N lines of input are two integers X and Y, each representing one point in the set.
(-10,000 ≤ X, Y ≤ 10,000)
Print out a single floating-point number F to 2 decimal places, the farthest distance between any pair of
points in the set.