#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;

vi par;
int find(int x) {
    if (x == par[x]) return x;
    return par[x] = find(par[x]);
}

bool unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return true;
    par[x] = y;
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cout.setf(ios::fixed);
    cout.precision(10);
    int n;
    cin >> n;
    vi xs(n), ys(n);
    for (int i = 0; i < n; i++) {
        cin >> xs[i] >> ys[i];
    }

    par = vi(n);
    iota(par.begin(), par.end(), 0);
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            i64 d = i64(xs[i] - xs[j]) * (xs[i] - xs[j]) + i64(ys[i] - ys[j]) * (ys[i] - ys[j]);
            if (d <= 10 * 10) {
                unite(i, j);
            }
        }
    }

    double ans = 1;
    for (int i = 0; i < n; i++) {
        find(i);
    }
    
    for (int i = 0; i < n; i++) {
        vi ps;
        for (int j = 0; j < n; j++) {
            if (par[i] == par[j]) ps.push_back(j);
        }
        double d = 0;
        for (int j = 0; j < ps.size(); j++) {
            for (int k = j + 1; k < ps.size(); k++) {
                d = max(d, hypot(xs[ps[k]] - xs[ps[j]], ys[ps[k]] - ys[ps[j]]));
            }
        }
        ans = max(ans, d + 2);
    }
    cout << ans << endl;
}