import sys input = sys.stdin.buffer.readline sys.setrecursionlimit(10 ** 7) inf = 10**18 class UF_tree: def __init__(self, n): self.root = [-1] * (n + 1) self.rank = [0] * (n + 1) def find(self, x): if self.root[x] < 0: return x self.root[x] = self.find(self.root[x]) return self.root[x] def isSame(self, x, y): return self.find(x) == self.find(y) def unite(self, x, y): x = self.find(x) y = self.find(y) if x == y: return False if self.rank[x] < self.rank[y]: self.root[y] += self.root[x] self.root[x] = y else: self.root[x] += self.root[y] self.root[y] = x if self.rank[x] == self.rank[y]: self.rank[x] += 1 return True def size(self, x): return -self.root[self.find(x)] def length(dist): l = 0 r = 10 ** 10 while r - l > 1: m = (l + r) // 2 if m * m * 100 >= dist: r = m else: l = m return r * 10 N = int(input()) XY = tuple(tuple(map(int, input().split())) for _ in range(N)) edge = [] G = [[0] * N for _ in range(N)] for i in range(N): x, y = XY[i] for j in range(i + 1, N): xx, yy = XY[j] dx = abs(x - xx) dy = abs(y - yy) edge.append((dx * dx + dy * dy, i, j)) edge.sort() uf = UF_tree(N) for L, x, y in edge: if uf.unite(x, y) and uf.isSame(0, N - 1): break print(length(L))