#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int,k>
template<class A,class B> void cmx(A& x, B y) {x=max<A>(x,y);}
template<class A,class B> void cmn(A& x, B y) {x=min<A>(x,y);}
typedef pair<int, int> pii;
typedef vector<int> vi;

int x[1002], y[1002];
vector<vi> kra;
int low[1002], gl[1002], ok;

void dfs(int n, int o) {
    gl[n] = gl[o] + 1;
    low[n] = gl[n];
    for (auto v : kra[n]) {
        if (v == o)
            continue;
        if (gl[v]) {
            cmn(low[n], gl[v]);
            continue;
        }
        dfs(v, n);
        cmn(low[n], low[v]);
        if (n != 0 && low[v] >= gl[n])
            ok = 0;
    }
//    cerr << n << " " << low[n] << " " << gl[n] << "\n";
}

bool check (int n, int d) {
//    cerr << d << "\n";
    ok = 1;
    kra.clear();
    kra.resize(n+1);
    for (int i = 0; i <= n; i++) {
        low[i] = gl[i] = 0;
        for (int j = i + 1; j <= n; j++) {
            if ((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) <= d)
                kra[i].PB(j), kra[j].PB(i);
        }
    }
    dfs(0, 0);
//    cerr << ok << "ok\n";
    return ok;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i];
    }
    vector<int> dists;
    for (int i = 0; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            dists.PB((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]));
        }
    }
    sort(all(dists));
    int pocz = 0, kon = sz(dists) - 1;
    while (pocz < kon) {
        int sr = (pocz + kon) / 2;
        if (check(n, dists[sr])) {
            kon = sr;
        } else {
            pocz = sr + 1;
        }
    }
    cout << fixed << setprecision(10) << sqrt(dists[pocz]) << "\n";
}