#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

struct UnionFind
{
	vector<int> rank;
	vector<int> rid;

	UnionFind(int n) {
		rank.resize(n);
		rid.assign(n, -1);
	}

	void unite(int u, int v) {
		u = root(u), v = root(v);
		if(u == v) { return ; }
		if(rank[u] < rank[v]) {
			rid[u] = v;
		}
		else {
			rid[v] = u;
			if(rank[u] == rank[v]) {
				rank[u]++;
			}
		}
	}

	bool same(int u, int v) {
		return root(u) == root(v);
	}

	int root(int x) {
		if(rid[x] < 0) return x;
		else return rid[x] = root(rid[x]);
	}
};

typedef long long ll;

ll N;
ll px[1010], py[1010];

#define SQ(x) ((x)*(x))

bool OK(ll x) {

	UnionFind uni(N*N);

	rep(i, N) {
		REP(j, i+1, N) {
			if(SQ(px[i]-px[j])+SQ(py[i]-py[j]) <= x*x) {
				uni.unite(i, j);
			}
		}
	}

	return uni.same(0, N-1);
}

int main() {

	cin >> N;

	rep(i, N) {
		cin >> px[i] >> py[i];
	}

	ll L = 0, R = 2*1e9;
	while(R-L>1) {
		ll M = (L+R)/2;
		if(OK(M)) {
			R = M;
		}
		else {
			L = M;
		}
	}

	cout << (R+9)/10*10 << endl;

	return 0;
}