#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, int> P;

const ll INF = LLONG_MAX;

int N;
ll X[1111], Y[1111], dist[1111];

ll max_dijkstra(int s, int t){
	priority_queue<P, vector<P>, greater<P>> Q;

	for(int i=0;i<N;i++)dist[i] = INF;
	dist[s] = 0;
	
	Q.push(P(0, s));
	while(!Q.empty()){
		P ps = Q.top(); Q.pop();

		ll mx = ps.first;
		int v = ps.second;

		if(dist[v] < mx)continue;
		for(int i=0;i<N;i++){
			ll dx = X[v] - X[i];
			ll dy = Y[v] - Y[i];
			ll d = dx * dx + dy * dy;

			ll nxt = max(mx, d);
			if(dist[i] > nxt){
				dist[i] = nxt;
				Q.push(P(nxt, i));
			}
		}
	}

	return dist[t];
}

int main(){
	cin >> N;
	for(int i=0;i<N;i++)cin >> X[i] >> Y[i];

	ll min_diff = max_dijkstra(0, N - 1);

	ll res = max(0ll, (ll)sqrt(min_diff) - 5);
	while(res * res < min_diff)++res;

	res = (res + 10 - 1) / 10 * 10;
	cout << res << endl;

	return 0;
}