#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <map>
#include <utility>


using namespace std;
typedef long long ll;

vector <pair<int, int>> a;
vector <long double> dist;
vector <bool> used;

int minDist() {
    int u = -1;
    long double d = 1e18;
    for (int i = 0; i < a.size(); i++)
        if (!used[i] && dist[i] < d) {
            d = dist[i];
            u = i;
        }

    return u;
}

void getDist(int v) {
    int x = a[v].first;
    int y = a[v].second;

    for (int i = 0; i < a.size(); i++) {
        if (used[i])
            dist[i] = 0;
        else
            dist[i] = min(dist[i], 1.0L * sqrt((x - a[i].first) * (x - a[i].first) + (y - a[i].second) * (y - a[i].second)));
    }
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(2);
    cout << fixed;

    int n;
    cin >> n;

    a.resize(n);
    dist.resize(n, 1e12);
    used.resize(n, false);
    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        a[i] = { x, y };
    }

    int v = 0;
    long double ans = 0.0;
    dist[v] = 0.0;
    used[v] = true;
    getDist(v);

    for (int i = 0; i < n - 1; i++) {
        int u = minDist();
        ans = max(ans, dist[u]);
        used[u] = true;
        v = u;
        getDist(v);
    }

    cout << ans;
    return 0;

}