#include <iostream>
#include <algorithm>
using namespace std;

typedef long long ll;

struct unionfind {
    vector<int> id;
    int size;
    unionfind(int size_):size(size_) {
        id=vector<int>(size);
        for(int i=0;i<size;++i) id[i]=i;
    }
    int root(int x) { return id[x]=id[x]==x?x:root(id[x]); }
    void unite(int x, int y) { x=root(x); y=root(y); if (x!=y) id[x]=y; }
    bool same(int x, int y) { return root(x)==root(y); }
};

vector<pair<ll, ll>> p;
int n;

ll dist(int i, int j)
{
#define sqr(x) ((x)*(x))
    return sqr(p[i].first-p[j].first)+sqr(p[i].second-p[j].second);
}
int main()
{
    while (cin>>n) {
        p=vector<pair<ll,ll>>(n);
        for(auto& v: p) { ll x, y; cin>>x>>y; v=make_pair(x, y); }
        ll L=0, R=sqrt(dist(0, n-1))*2;
        while (R-L>2) {
            ll M=(L+R)/2;
            unionfind a(n);
            for(int i=0;i<n;++i) for(int j=0;j<n;++j) if (i!=j and dist(i, j)<=M*M)
                a.unite(i, j);
            if (a.same(0, n-1))
                R=M+1;
            else
                L=M;
        }
        cout<<(R-1+9)/10*10<<endl;
    }
}