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 as comb

N = int(input())
l = [tuple(map(int, input().split())) for _ in range(N)]
dist = lambda a,b:((a[0]-b[0])**2+(a[1]-b[1])**2)**0.5


def get_centers():
    ans = []
    for a, b, c in comb(l, 3):
        x1, y1 = a
        x2, y2 = b
        x3, y3 = c

        A = 2 * (x2-x1)
        B = 2 * (y2-y1)
        D = 2 * (x3-x2)
        E = 2 * (y3-y2)
        C = x1**2-x2**2+y1**2-y2**2
        F = x2**2-x3**2+y2**2-y3**2

        if B*D-A*E!=0:
            cy = (A*F-C*D)/(B*D-A*E)
            cx = -(F+E*cy)/D if D else -(C+B*cy)/A
            r = dist(a, (cx,cy))
            ans.append((cx, cy, r))

    for a, b in comb(l, 2):
        d = min(a,b)
        e = max(a,b)
        ans.append(((d[0]+e[0])/2, (d[1]+e[1])/2, dist(d,e)/2))

    return ans

if N==2:
    d = l[0]
    e = l[1]
    print(dist(d, e)/2)
else:
    ans = 10**12
    for xr, yr, r in get_centers():
        v = 0
        for x, y in l:
            v += dist((x,y),(xr,yr))<=r
        if v==N:
            ans = min(ans, r)
    print(ans)