// yukicoder: No.168 ものさし
// 2019.7.15 bal4u

#include <stdio.h>
#include <math.h>

typedef long long ll;

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

#define MAX 1003
/* UNION-FIND library */
int id[MAX], size[MAX];
void init(int n) { int i; for (i = 0; i < n; i++) id[i] = i, size[i] = 1; }
int root(int i) { while (i != id[i]) id[i] = id[id[i]], i = id[i]; return i; }
int connected(int p, int q) { return root(p) == root(q); }
void unite(int p, int q) {
    int i = root(p), j = root(q); if (i == j) return;
    if (size[i] < size[j]) id[i] = j, size[j] += size[i]; else id[j] = i, size[i] += size[j];
}

typedef struct { int i, j; ll w; } T;
T t[500005]; int sz;
int N;
int x[MAX], y[MAX];

void Qsort(T *a, int l, int r) {
	int i,j; T t; ll m;
	
	i = l, j = r, m = a[(l+r) >> 1].w;
	while (1) {
		while (a[i].w < m) i++;
		while (m < a[j].w) j--;
		if (i >= j)	break;
		t = a[i], a[i] = a[j], a[j] = t;
		i++, j--;
	}
	if (l+1 < i) Qsort(a, l, i-1);
	if (j+1 < r) Qsort(a, j+1, r);
}

int main()
{
	int i, j;
	ll a, ans;

	N = in(); for (i = 0; i < N; i++) x[i] = in(), y[i] = in();
	init(N);
	for (i = 0; i < N; i++) for (j = i+1; j < N; j++) {
		ll dx = x[i] - x[j], dy = y[i] - y[j];
		t[sz].i = i, t[sz].j = j, t[sz++].w = dx*dx + dy*dy;
	}
	Qsort(t, 0, sz-1);
	ans = 0; for (i = 0; i < sz; i++) {
		if (!connected(t[i].i, t[i].j)) {
			ans = t[i].w, unite(t[i].i, t[i].j);
			if (connected(0, N-1)) break;
		}
	}
	a = sqrt((double)ans);
	if (a*a < ans) a++;
	printf("%lld\n", ((a-1)/10+1)*10);
	return 0;
}