#include <bits/stdc++.h>
using namespace std;
int group[1000];
int find(int a){
    if(a==group[a])	return a;
    return group[a]=find(group[a]);
}
void merge(int a,int b){
    a=find(a);	b=find(b);
    group[a]=b;
}
double sq(long long int ll){
    double r=1e10,l=0;
    while(r-l>0.1){
        long long int m=(r+l)/2;
        if(m*m>ll)	r=m;
        else 	l=m;
    }
    return (r+l)/2;
}
int main(){
    int n;	cin>>n;
    long long int x[n],y[n];
    for(int i=0;i<n;i++)	cin>>x[i]>>y[i];
    vector<tuple<long long int,int,int>> v;
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            v.push_back(make_tuple((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]),i,j));
        }
    }
    for(int i=0;i<n;i++)	group[i]=i;
    long long int l=0;
    sort(v.begin(),v.end());
    for(int i=0;i<(int)v.size();i++){
        long long int length=get<0>(v[i]);
        int a=get<1>(v[i]),b=get<2>(v[i]);
        if(find(a)!=find(b)){
            l=length;
            merge(a,b);
        }
        if(find(0)==find(n-1))	break;
    }
    long long int calc=sq(l)/10;	calc*=10;
    while(calc*calc<l) calc+=10;
   cout<<calc<<endl; 
    return 0;
}