#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;
typedef long long LL;

LL distance2(vector<pair<int,int> >& p, int p1, int p2){
    LL dx = p[p1].first - p[p2].first;
    LL dy = p[p1].second - p[p2].second;
    return dx*dx + dy*dy;
}

int main(){
    int N;
    cin >> N;
    vector<pair<int,int> > p(N);
    for(int i = 0; i < N; i++){
        cin >> p[i].first >> p[i].second;
    }
    priority_queue<pair<LL,int>, vector<pair<LL,int> >, greater<pair<LL,int> > > q;
    q.push(pair<LL,int>(0, 0));
    LL max_dist = 0;
    vector<int> memo(N);
    while(!q.empty()){
        LL w = q.top().first;
        int pos = q.top().second;
        q.pop();
        max_dist = max(max_dist, w);
        if(pos == N-1) break;
        if(memo[pos]) continue;
        memo[pos] = 1;
        for(int i = 0; i < N; i++){
            LL dist2 = distance2(p, pos, i);
            q.push(pair<LL,int>(dist2, i));
        }
    }
    LL ans = LL(sqrt(max_dist)) / 10 * 10;
    while(ans*ans < max_dist) ans += 10;
    cout << ans << endl;

    return 0;
}