#include<iostream>
using namespace std;
#include<vector>
struct UF{
	int n;
	vector<int>parent,rank;
	UF(int n_=0):n(n_),parent(n_),rank(n_,1)
	{
		for(int i=0;i<n_;i++)parent[i]=i;
	}
	int find(int a){return parent[a]!=a?parent[a]=find(parent[a]):a;}
	bool same(int a,int b){return find(a)==find(b);}
	bool unite(int a,int b)
	{
		a=find(a),b=find(b);
		if(a==b)return false;
		if(rank[a]<rank[b])
		{
			parent[a]=b;
			rank[b]+=rank[a];
		}
		else
		{
			parent[b]=a;
			rank[a]+=rank[b];
		}
		return true;
	}
	int size(int a){return rank[find(a)];}
};
int N;
long x[1000],y[1000];
main()
{
	cin>>N;
	for(int i=0;i<N;i++)cin>>x[i]>>y[i];
	long L=0,R=2e9;
	while(R-L>1)
	{
		long M=(L+R)/2;
		UF uf(N);
		for(int i=0;i<N;i++)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])<=M*M)uf.unite(i,j);
		}
		if(uf.same(0,N-1))R=M;
		else L=M;
	}
	cout<<(R+9)/10*10<<endl;
}