#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

void solve() {
    int n;
    cin >> n;
    dsu uf(n);
    using D = long double;
    using P = pair<D, D>;
    vector<P> pos(n);
    rep(i, n) {
        int x, y;
        cin >> x >> y;
        pos[i] = {x, y};
    }
    D ans = 1;
    const D eps = 1e-9;
    rep(i, n) rep(j, i) {
        D x1 = pos[i].first, y1 = pos[i].second;
        D x2 = pos[j].first, y2 = pos[j].second;
        if (hypotl(x1 - x2, y1 - y2) < 10 + eps) {
            uf.merge(i, j);
        }
    }
    rep(i, n) rep(j, n) if (uf.same(i, j)) {
        D x1 = pos[i].first, y1 = pos[i].second;
        D x2 = pos[j].first, y2 = pos[j].second;
        D d = hypotl(x1 - x2, y1 - y2);
        chmax(ans, d + 2);
    }
    cout << fixed << setprecision(15);
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}