#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>

using namespace std;

typedef pair<long long, long long> PLL;


class UnionFind {
private:
	vector<int> parent;
	int trees;

public:
	UnionFind() {
	}

	UnionFind(int n) {
		trees = n;
		parent.assign(n, 0);

		for (int i = 0; i < n; i++) {
			parent[i] = i;
		}
	}

	int find(int x) {
		if (parent[x] == x) {
			return x;
		} else {
			return parent[x] = find(parent[x]);
		}
	}

	bool same(int x, int y) {
		return find(x) == find(y);
	}

	void unite(int x, int y) {
		x = find(x);
		y = find(y);

		if (x != y) {
			parent[x] = y;
			trees--;
		}
	}

	int count() {
		return trees;
	}
};

int main() {
	int n, x, y;
	vector<PLL> points;

	cin >> n;
	points.assign(n, PLL());

	for (int i = 0; i < n; i++) {
		cin >> x >> y;
		points[i] = make_pair(x, y);
	}

	vector<PLL> length2;

	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			long long x = points[i].first  - points[j].first;
			long long y = points[i].second - points[j].second;

			length2.push_back(make_pair(x * x + y * y, i * 10000 + j));
		}
	}

	sort(length2.begin(), length2.end());

	UnionFind uf(n);
	long long ans2 = -1;
	for (int i = 0; i < length2.size(); i++) {
		int x = length2[i].second / 10000;
		int y = length2[i].second % 10000;
		uf.unite(x, y);
		if (uf.same(0, n - 1)) {
			ans2 = length2[i].first;
			break;
		}
	}

	long long ans = sqrt(ans2);
	while(ans * ans < ans2) {
		ans++;
	}

	ans = (ans + 9) / 10 * 10;
	cout << ans << endl;
	return 0;
}