#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }

using ll = long long;
using PLL = pair <ll, ll>;
using PLI = pair <ll, int>;
int N;
ll cost[1010];
vector <PLL> XY;
PLL start;
PLL goal;

inline ll pow2(ll x){
  return x * x;
}


inline ll calc(int i, int j){
  return pow2(abs(XY[i].fir - XY[j].fir)) + pow2(abs(XY[i].sec - XY[j].sec));
}


int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N;
  rep(i,N){
    ll x,y;
    cin >> x >> y;
    XY.push_back(mp(x,y));
    cost[i] = -1;
  }
  start = XY.front();
  goal = XY.back();
  priority_queue <PLI, vector <PLI>, greater <PLI> > que;
  que.push(mp(0,0));
  while(!que.empty()){
    auto t = que.top();
    que.pop();
    int now = t.sec;
    ll c = t.fir;
    if (cost[now] == -1 || cost[now] > c) {
      cost[now] = c;
    }else{
      continue;
    }
    if (now == N - 1) {
      break;
    }
    rep(i,N){
      if (i == now) {
        continue;
      }
      auto nc = max(cost[now], calc(now,i));
      if (cost[i] == -1 || cost[i] > nc) {
        que.push(mp(nc, i));
      }
    }
  }

  ll ans = ceil((long double) sqrt((long double)cost[N-1]));
  for (;;ans++){
    if (ans % 10 == 0) {
      break;
    }
  }
  cout << ans << endl;
  return 0;
}