#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

class UF {
private:
    int sz;
    vector<int> par;
    vector<int> nrank;

public:
    UF(int node_size){
        sz = node_size;
        par.resize(sz);
        nrank.resize(sz);
    	rep(i,sz){
    		par[i] = i;
    		nrank[i] = 0;
    	}
    }

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

    void unite(int x,int y){
    	x = find(x);
    	y = find(y);
    	if(x == y) return;
    	if(nrank[x] < nrank[y]){
    		par[x] = y;
    	}else{
    		par[y] = x;
    		if(nrank[x] == nrank[y])
    			nrank[x]++;
    	}
    }

    bool same(int x,int y){
    	return find(x) == find(y);
    }
};

int n;
vector<ll> x,y;

bool possible(ll cri)
{
    UF uf(n);
    rep(i,n){
        for(int j=i+1;j<n;j++){
            if((x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]) <= cri*cri){
                uf.unite(i,j);
            }
        }
    }
    return uf.same(0,n-1);
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    x.resize(n),y.resize(n);
    rep(i,n){
        cin >> x[i] >> y[i];
    }
    ll l = 0,h = 150000000;
    while(1){
        ll mid = (l + h) / 2;
        if(mid == l){
            cout << h*10 << endl;
            return 0;
        }
        if(possible(mid*10)){
            h = mid;
        }else{
            l = mid;
        }
    }
    return 0;
}