#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<ll> X(N), Y(N);
    for(int i = 0; i < N; ++i)  cin >> X[i] >> Y[i];
    
    vector<vector<ll>> d(N, vector<ll>(N));
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < i; ++j){
            ll dx = abs(X[i] - X[j]), dy = abs(Y[i] - Y[j]);
            d[i][j] = d[j][i] = dx * dx + dy * dy;
        }
    }

    auto bfs = [&](int s, ll bound){
        vector<ll> dist(N, INF);
        queue<int> que;
        dist[s] = 0;
        que.emplace(s);
        while(!que.empty()){
            int from = que.front();
            que.pop();
            for(int to = 0; to < N; ++to){
                if(to == from || d[from][to] > bound)   continue;
                if(chmin(dist[to], dist[from] + 1)){
                    que.emplace(to);
                }
            }
        }
        return dist;
    };

    ll lb = 0, ub = 3e+18;
    while(ub - lb > 1){
        ll mid = (lb + ub) / 2;
        auto dist1 = bfs(0, mid);
        auto distN = bfs(N - 1, mid);
        bool ok = false;
        for(int i = 0; i < N; ++i){
            if(dist1[i] != INF && distN[i] != INF)  ok = true;
        }
        if(ok)  ub = mid;
        else    lb = mid;
    }

    ll low = 0, high = 2e+9;
    while(high - low > 1){
        ll mid = (low + high) / 2;
        if(mid * mid >= ub) high = mid;
        else    low = mid;
    }

    cout << high / 10 * 10 + (high % 10 > 0) * 10 << endl;

    return 0;
}