#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair< int, int > pii;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef vector< pii > vp;
typedef vector< vp > vvp;
typedef vector< string > vs;
typedef vector< double > vd;
typedef vector< vd > vvd;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N;
vi X, Y;

void init(){
  cin >> N;
  X = Y = vi( N );
  for( int i = 0; i < N; ++i )
    cin >> X[ i ] >> Y[ i ];
}

vector< tuple< ll, int, int > > edge;

ll eu_dis2( int x, int y, int a, int b ){
  ll dx = x - a;
  ll dy = y - b;
  return dx * dx + dy * dy;
}

struct dsu{
  vi fa;
  dsu( int sz ){
    fa = vi( sz );
    for( int i = 0; i < sz; ++i )
      fa[ i ] = i;
  }
  int find( int x ){
    return fa[ x ] == x ? x : fa[ x ] = find( fa[ x ] );
  }
  int merge( int x, int y ){
    int a = find( x );
    int b = find( y );
    if( a == b )
      return 0;
    fa[ b ] = a;
    return 1;
  }
};

void preprocess(){
  for( int i = 0; i < N; ++i )
    for( int j = i + 1; j < N; ++j ){
      ll dis2 = eu_dis2( X[ i ], Y[ i ], X[ j ], Y[ j ] );
      edge.emplace_back( dis2, i, j );
    }
  sort( edge.begin(), edge.end() );
  dsu *uf = new dsu( N );
  for( int i = 0; i < edge.size(); ++i ){
    ll d; int x, y; tie( d, x, y ) = edge[ i ];
    uf->merge( x, y );
    if( uf->find( 0 ) == uf->find( N - 1 ) )
      cout << ( int ) ceil( sqrt( d ) ) << endl, exit( 0 );
  }
}

void solve(){
  
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}