#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev            coyhhhhhhyoc    
#define next          sdNNNmNNNNNNNmds  
#define y0           hNNNNy_yNNNNNN_sNh
#define y1          mNNNNNdtdNNNNNNtsNNm
#define yn          mNNNNNNNNy___smNNNms
#define tm            oooooosyysooooot 
#define read               tyhyt        
#define rank              ytmNmo         
#define index              yyy
#define pb push_back
#define pcnt __builtin_popcountll
#define rrep(i,a,b) for(int i = (b); i >= (a); i--)
#define rall(x,a) for(auto x : a)
#define MOD 1000000007
#define endl "\n"
typedef long long ll;
using namespace std;

struct Ed {
    int u, v, d;
};

bool comp(const Ed& a, const Ed& b) {
    return a.d < b.d;
}

const int N = 111;
int x[N], y[N], dsu[N], rank[N];
vector<Ed> ev;
int n;

int find(int u) {
    if(dsu[u] == u) return u;
    dsu[u] = find(dsu[u]);
    return dsu[u];
}

bool merge(int u, int v) {
    u = find(u), v = find(v);
    if(u == v) return false;
    if(rank[u] > rank[v]) {
        dsu[v] = u;
    } else {
        dsu[u] = v;
        if(rank[u] == rank[v]) {
            rank[v]++;
        }
    }
    return true;
}

int solve() {
    cin >> n;
    rep(i, 1, n) {
        cin >> x[i] >> y[i];
    }
    rep(i, 1, n + 2) {
        dsu[i] = i;
    }
    rep(i, 1, n) {
        rep(j, 1, i - 1) {
            int dx = x[i] - x[j], dy = y[i] - y[j];
            ev.pb({i, j, dx * dx + dy * dy});
        }
        int dy1 = y[i] + 100, dy2 = 100 - y[i];
        ev.pb({i, n + 1, dy1 * dy1});
        ev.pb({i, n + 2, dy2 * dy2});
    }
    sort(rng(ev), comp);
    int ans = 0;
    rall(e, ev) {
        ans = max(ans, e.d);
        merge(e.u, e.v);
        int u = find(n + 1), v = find(n + 2);
        if(u == v) {
            break;
        }
    }
    double anss = sqrt(ans) * .5;
    cout << fixed << setprecision(13) << anss << endl;
    return 0;
}
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    while(t--) {
        solve();
    }
    return 0;
}

/*
link: 
tags: 
*/
#include<bits/stdc++.h>
#define to_l(a) ((a)<<1)
#define to_r(a) ((a)<<1|1)
#define lowbit(a) ((a)&(-a))
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
const int int_inf=0x3f3f3f3f;
const ll ll_inf=0x3f3f3f3f3f3f3f3f;
const int max_n=1e2+5;
#define eps 1e-8
int x[max_n],y[max_n];
double dis[max_n][max_n];
int pa[max_n];
inline int find(int a){
	return pa[a]?pa[a]=find(pa[a]):a;
}
void merge(int a,int b){
	a=find(a),b=find(b);
	if(a==b) return ;
	pa[a]=b;
	return ;
}
bool judge(int n,double mid)
{
	mid=mid*2.0;
	pa[101]=pa[102]=0;
	for(int i=1;i<=n;i++){
		pa[i]=0;
	}
	for(int i=1;i<=n;i++){
		if(mid-(100-y[i])>eps){
			merge(i,101);
		}
		if(mid-(y[i]-(-100))>eps){
			merge(i,102);
		}
		for(int j=i+1;j<=n;j++){
			if(mid-dis[i][j]>eps){
				merge(i,j);
			}
		}
	}
	return find(101)!=find(102);
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>x[i]>>y[i];
	}
	auto get_dis = [](int a,int b) -> double{
		return sqrt((x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b]));
	};
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			dis[i][j]=get_dis(i,j);
		}
	}
	double l=0.0,r=100.0,res=0.0;
	while(r-l>=eps){
		double mid=(l+r)/2.0;
		if(judge(n,mid)){
			l=mid;
			res=mid;
		}else{
			r=mid;
		}
	}
	cout<<res<<endl;
	return 0;
}