#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;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
using namespace std;
const long double eps = 1e-6;

int read(){
	int x=0,f=1;
	char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c)){x=(x<<3)+(x<<1)+c-48;c=getchar();}
	return x*f;
}

int k,m,n;
struct node{
	int x,y;
	int zx,zd;
}a[110];
int fa[110];
int find(int x){if(x==fa[x])return x;return fa[x]=find(fa[x]);}
long double dis(int x,int y){return sqrt((a[x].x-a[y].x)*(a[x].x-a[y].x)+(a[x].y-a[y].y)*(a[x].y-a[y].y));}
bool check(long double mid){
	for(int i=1;i<=n;i++){
		fa[i]=i;
		a[i].zx=100;a[i].zd=-100;
	}
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			if(dis(i,j)<=mid)fa[find(i)]=fa[find(j)];
		}
	}
	for(int i=1;i<=n;i++){
		int x=find(i);
		a[x].zx=min(a[x].zx,a[i].y);
		a[x].zd=max(a[x].zd,a[i].y);
	}
	for(int i=1;i<=n;i++){
		if(i==find(i)){
			//cout<<i<<" "<<a[i].zx<<" "<<a[i].zd<<" "<<mid<<endl;
			if(a[i].zx+100<=mid && 100-a[i].zd<=mid)return false;
		}
	}
	return true;
}
int main(){
	n=read();
	for(int i=1;i<=n;i++){
		a[i].x=read();a[i].y=read();
	}
	long double l=0,r=200,ans=0;
	while(l+eps<=r){
		long double mid=(l+r)/2;
		if(check(mid)){ans=r;l=mid;}
		else r=mid;
	}
	printf("%.6Lf\n",ans/2);
	return 0;
}