Smallest Hurricane Distance

In this problem, you are given the path of a hurricane represented by a series of integer coordinate points and the location of a city. Your task is to calculate the smallest Euclidean distance between any point on the hurricane's path and the city. The Euclidean distance between a point ((x_i, y_i)) and the city ((x_c, y_c)) is defined as

Return the minimum distance rounded to two decimal places.

inputFormat

The input is given via standard input (stdin). The first line contains an integer (N) which represents the number of points on the hurricane's path. Each of the next (N) lines contains two space-separated integers (x) and (y) representing a point on the hurricane's path. The final line contains two space-separated integers representing the coordinates of the city.

outputFormat

Output to standard output (stdout) a single line containing the smallest Euclidean distance between the hurricane's path and the city, rounded to two decimal places.## sample

3
1 1
2 3
4 4
2 2

1.00