#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

struct UnionFind{
  vi p;
  void init(int n){
    p.resize(n);
    FOR(i, 0, n) p[i] = -1;
  }
  int find(int a){
    if(p[a] < 0) return a;
    p[a] = find(p[a]);
    return p[a];
  }
  bool merge(int a, int b){
    a = find(a);
    b = find(b);
    if(a == b) return false;
    if(p[a] < p[b]) swap(a, b);
    p[a] += p[b];
    p[b] = a;
    return true;
  }
};
ll n, pos[1000][2];
vector<pair<ll, pii> > d;

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, n) cin >> pos[i][0] >> pos[i][1];
  FOR(i, 0, n-1)FOR(j, i+1, n) d.pb(mp((pos[i][0] - pos[j][0])*(pos[i][0] - pos[j][0])+(pos[i][1] - pos[j][1])*(pos[i][1] - pos[j][1]), mp(i, j)));
  sort(rng(d));
  ll ans = 0;
  UnionFind uf;
  uf.init(n);
  each(itr, d){
    if(uf.merge(itr->se.fi, itr->se.se)) maxs(ans, itr->fi);
    if(uf.find(0)==uf.find(n-1)) break;
  }
  ll ans2 = ll(ceil(sqrt(ans)/10) * 10);
  if(ans2*ans2 < ans) ans2+=10;
  cout << ans2 << endl;
  return 0;
}