Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

int n;
pair<int,int> poi[57];

double f(double x, double y, int v)
{
	x-=poi[v].first;
	y-=poi[v].second;
	return x*x+y*y;
}

double knowxy(double x, double y)
{
	double ret=0;
	for (int i=1; i<=n; i++)
		ret=max(ret, f(x, y, i));
	return ret;
}

double knowx(double x)
{
	double bsa=-1000;
	double bsb=1000;
	for (int h=0; h<100; h++)
	{
		double bs1=(2*bsa+bsb)/3;
		double bs2=(bsa+2*bsb)/3;
		if (knowxy(x, bs1)<knowxy(x, bs2))
			bsb=bs2;
		else
			bsa=bs1;
	}
	return knowxy(x, bsa);
}

int main()
{
	scanf("%d", &n);
	for (int i=1; i<=n; i++)
		scanf("%d%d", &poi[i].first, &poi[i].second);
	double bsa=-1000;
	double bsb=1000;
	for (int h=0; h<100; h++)
	{
		double bs1=(2*bsa+bsb)/3;
		double bs2=(bsa+2*bsb)/3;
		if (knowx(bs1)<knowx(bs2))
			bsb=bs2;
		else
			bsa=bs1;
	}
	printf("%.9lf\n", sqrt(knowx(bsa)));
	return 0;
}