#include<bits/stdc++.h>
using namespace std;
typedef long long int64;
#define SQR(a) ((int64)(a)*(int64)(a))
struct edge {
  int u, v;
  int64 cost;
  bool operator<(const edge& e) const {
    return(cost < e.cost);
  }
};

class UnionFind{
private:
  vector< int > rank, p;
  void link(int x,int y){
    if(rank[x] > rank[y]){
      p[y] = x;
    }else{
      p[x] = y;
      if(rank[x] == rank[y]) rank[y]++;
    }
  }
public:
  UnionFind(int size){
    rank.resize(size,0);
    p.resize(size,0);
    for(int i = 0; i < rank.size(); i++){
      p[i] = i, rank[i] = 0;
    }
  }
  void Unite(int x,int y){
    link(Find(x),Find(y));
  }
  int Find(int x){
    return( x != p[x] ? p[x] = Find(p[x]) : p[x]);
  }
  bool Same(int a, int b) {
    return(Find(a) == Find(b));
  }
};

int main()
{
  int N, X[1000], Y[1000];
  cin >> N;
  UnionFind uf(N);
  for(int i = 0; i < N; i++) {
    cin >> X[i] >> Y[i];
  }
  vector< edge > edges;
  for(int i = 0; i < N; i++) {
    for(int j = i + 1; j < N; j++) {
      int64 low = 0, high = 1LL << 32;
      while(high - low > 0) {
        int64 mid = (low + high) >> 1LL;
        if(SQR(mid) >= SQR(X[i] - X[j]) + SQR(Y[i] - Y[j])) high = mid;
        else low = mid + 1;
      }
      edges.push_back((edge){i, j, (low + 9) / 10LL * 10LL});
    }
  }
  sort(edges.begin(), edges.end());

  int64 ret = 0;

  for(int i = 0; i < N; i++) {
    edge& e = edges[i];
    if(uf.Same(e.u, e.v)) continue;
    ret = e.cost;
    uf.Unite(e.u, e.v);
    if(uf.Same(0, N - 1)) break;
  }
  cout << ret << endl;
}