#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) {
    return distance(begin, min_element(begin, end));
}
template<typename iterator> inline size_t argmax(iterator begin, iterator end) {
    return distance(begin, max_element(begin, end));
}
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;


class unionfind {
public:
    vector<int> data;
    unionfind(int size) : data(size, -1) { }
    bool union_set(int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y]; data[y] = x;
        }
        return x != y;
    }
    inline bool find_set(int x, int y) {
        return root(x) == root(y);
    }
    inline int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    inline int size(int x) {
        return -data[root(x)];
    }
};

class Graph {
public:
    size_t n;
    vector<vector<int>> vertex_to;

    Graph(size_t n) :n(n), vertex_to(n) {}

    void connect(int from, int to) {
        vertex_to[from].emplace_back(to);
        vertex_to[to].emplace_back(from);
    }
    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
    }
};

template<typename INTEGER>
INTEGER b_search(INTEGER l, INTEGER h, auto func){
    ++h;
    // --l;
    INTEGER c;
    while (l + 1 < h) {
        c = (l + h) / 2;
        if (func(c)) {
            h = c;
        }
        else {
            l = c;
        }
    }
    return h;
    // return l;
}

int m, n, kei;

ll px[1010], py[1010];

ll distan[1010][1010];

int main() {

    scanner >> n;

    vector<vector<ll>> stock;

    repeat(i, n) {
        ll x,y;
        scanner >> px[i] >> py[i];
    }

    repeat(i, n) {
        ll x1 = px[i];
        ll y1 = py[i];
        iterate(j, i+1, n) {
            ll x2 = px[j];
            ll y2 = py[j];

            distan[j][i] = distan[i][j] = (x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2);
            
            stock.push_back({ distan[i][j],i,j });
        }
    }
    sort(ALL(stock));

    unionfind uf(n);

    Graph g(n);
    m = 0;
    for (int i = 0; m < n - 1; ++i) {
        auto& st = stock[i];
        
        if (uf.union_set(st[1], st[2])) {
            ++m;
            g.connect(st[1], st[2]);
        }
    }

    vector<int> moving(n);

    function<int(int,int)> dfs = [&](int index,int last) {
        if (index == n - 1) return 0;

        for (int to : g.vertex_to[index]) {
            if (to == last) continue;
            int r = dfs(to, index);
            if (0 <= r) {
                return moving[index] = r + 1;
            }
        }
        return -1;
    };
    dfs(0, -1);

    function<ll(int)> dfs2 = [&](int index) {
        if (index == n - 1) return 0ll;

        for (int to : g.vertex_to[index]) {
            if (moving[index] - 1 != moving[to]) continue;
            
            return max(distan[index][to], dfs2(to));
        }
    };
    ll len = dfs2(0);
    double l = b_search(0.0,1e9+999,[&len](double z){return len<=z*z;});
    
    cout << (ll)ceil(l / 10) * 10 << endl;

    return 0;
}