#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define INFL 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;

class UnionFind {
	vector<int>par, sz;
public:
	UnionFind(int n) {
		par = sz = vector<int>(n);
		for (int i = 0; i < n; i++) {
			par[i] = i;
			sz[i] = 1;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x); y = find(y);
		if (x == y)return;
		if (sz[x] > sz[y]) {
			par[y] = x;
			sz[x] += sz[y];
		}
		else {
			par[x] = y;
			sz[y] += sz[x];
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
	int size(int x) {
		return sz[find(x)];
	}
};
ll x[1000],y[1000];

int main(){
	int n;scanf("%d",&n);
	rep(i,n)scanf("%lld%lld",&x[i],&y[i]);
	ll l=0,r=2000000000;
	while(l!=r){
		ll t=(l+r)/2;
		UnionFind 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])<=t*t)uf.unite(i,j);
		}
		if(uf.same(0,n-1))r=t;
		else l=t+1;
	}
	cout<<(l+9)/10*10<<endl;
}