Given are N points (x_i, y_i) in a two-dimensional plane.

Find the minimum radius of a circle such that all the points are inside or on it.

Constraints

* 2 \leq N \leq 50
* 0 \leq x_i \leq 1000
* 0 \leq y_i \leq 1000
* The given N points are all different.
* The values in input are all integers.

Input

Input is given from Standard Input in the following format:


N
x_1 y_1
:
x_N y_N


Output

Print the minimum radius of a circle such that all the N points are inside or on it.

Your output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.

Examples

Input

2
0 0
1 0


Output

0.500000000000000000


Input

3
0 0
0 1
1 0


Output

0.707106781186497524


Input

10
10 9
5 9
2 0
0 0
2 7
3 3
2 5
10 0
3 7
1 9


Output

6.726812023536805158
from itertools import combinations

epsilon = 5 * 10 ** (-7)

N = int(input())
#Get points as complex numbers like x + yi.
points = [complex(*list(map(int, input().split()))) for _ in range(N)]


#try a circle that has a line connecting farthest 2 points as a diameter.
longest_radius = 0
for p, q in combinations(points, 2):
    radius = abs(p - q) / 2
    if longest_radius < radius:
        longest_radius = radius
        center = (p + q) / 2

out_of_circle = False
for s in points:
    if abs(s - center) > longest_radius + epsilon:
        out_of_circle = True
        break

if not out_of_circle:
    print(longest_radius)
    exit()


#If failed, then try any circles that has 3 or more points on the edge.
smallest_radius = 10 ** 9
for p, q, r in combinations(points, 3):
    denominator = (p-q)*r.conjugate() + (q-r)*p.conjugate() + (r-p)*q.conjugate()
    if denominator == 0 + 0j:
        continue
    numerator = (p-q)*(abs(r)**2) + (q-r)*(abs(p)**2) + (r-p)*(abs(q)**2)
    center = numerator/denominator
    radius = abs(p - center)

    for s in points:
        if abs(s - center) > radius + epsilon:
            break
    else:
        smallest_radius = min(smallest_radius, radius)

print(smallest_radius)
