#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct UnionFind {
    vector<int> data;
    UnionFind(int n) {
        data.assign(n, -1);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y)
            return (false);
        if (data[x] > data[y])
            swap(x, y);
        data[x] += data[y];
        data[y] = x;
        return (true);
    }
    int root(int k) {
        if (data[k] < 0)
            return (k);
        return (data[k] = root(data[k]));
    }
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    int size(int k) {
        return (-data[root(k)]);
    }
};

int main() {
    int N;
    ll X[1010], Y[1010];
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> X[i] >> Y[i];
    }

    auto len_sqrt = [&](int i, int j) {
        ll dx = abs(X[i] - X[j]), dy = abs(Y[i] - Y[j]);
        return dx * dx + dy * dy;
    };

    vector<pair<ll, pair<int, int>>> len;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < i; j++) {
            len.push_back({len_sqrt(i, j), {i, j}});
        }
    }

    sort(len.begin(), len.end());

    UnionFind uf(N);
    ll ans = 0;

    for (auto& e : len) {
        auto p = e.second;
        uf.unite(p.first, p.second);
        ans = e.first;
        if (uf.same(0, N - 1))
            break;
    }

    ans = (sqrt(ans) + 10 - 0.0000000001);
    ans = ans / 10 * 10;
    cout << ans << endl;
}