#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
#define INF 2000000000000000100
ll G[1000][1000];
ll d[1000],x[1000],y[1000];
int n;
bool visited[1000];
ll mysqrt(ll t){
  ll a=0,b=1500000000;
  for(int i=0;i<100;++i){
    ll r=(a+b+1)/2;
    if(r*r<=t) a=r;
    else b=r;
  }
  if(a*a==t) return (a+9)/10*10;
  return (b+9)/10*10;
}
int main(){
  cin>>n;
  for(int i=0;i<n;++i) cin>>x[i]>>y[i];
  for(int i=0;i<n;++i) for(int j=0;j<n;++j) G[i][j] = (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);

  for(int i=1;i<n;++i) d[i]=INF;
  while(1){
    int idx=-1;
    ll m=INF;
    for(int i=0;i<n;++i){
      if(m > d[i] && !visited[i]){
	        idx = i;
	        m = d[i];
      }
    }
    if(idx==-1) break;
    visited[idx]=true;
    for(int i=0;i<n;++i){
      if(G[idx][i]!=0)	d[i]=min(d[i],max(m,G[idx][i]));
    }
  }
    cout << mysqrt(d[n-1]) << endl;
  return 0;
}