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

struct UnionFind{
    vector<int> data;

    UnionFind(int sz) {
    data.assign(sz, -1);
  }
 
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if(x == y) return (false);
    if(data[x] > data[y]) swap(x, y);//親は負でサイズを保存
    data[x] += data[y];
    data[y] = x;
    return (true);
  }
 
  int find(int k) {
    if(data[k] < 0) return (k);
    return (data[k] = find(data[k]));
  }

  bool same(int x, int y){
      return find(x) == find(y);
  }
 
  int size(int k) {
    return (-data[find(k)]);
  }
};

int n;
ll dist[1010][1010];
bool ok(ll len){
  UnionFind uf(n);
  rep(x,n) rep(y,n) {
    if (len * len >= dist[x][y]) uf.unite(x,y);
  }
  return uf.same(0,n-1);
}

int main(){

  cin >> n;
  vector<ll> x(n), y(n);
  rep(i,n) cin >> x[i] >> y[i];

  rep(i,n) {
    rep(j,n) dist[i][j] = (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]);
  }

  ll left = 0, right = 1e10;
  while (right - left > 1) {
    ll mid = (left + right) / 2;
    if ( ok(mid) ) right = mid;
    else left = mid;
  }

  if (right % 10 != 0) (right -= right % 10) += 10;
  cout << right << endl;
  return 0;
}