import itertools
from math import isqrt

ceil = lambda a, b: (a + b - 1) // b
ceil_sq = lambda n: 1 + isqrt(n - 1)


class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parent = [i for i in range(n)]
        self.height = [1] * n
        self.size = [1] * n

    def find(self, x):
        if self.parent[x] == x:
            return x
        else:
            self.parent[x] = self.find(self.parent[x])
            return self.parent[x]

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.height[x] < self.height[y]:
                self.parent[x] = y
                self.size[y] += self.size[x]
            else:
                self.parent[y] = x
                self.size[x] += self.size[y]
                if self.height[x] == self.height[y]:
                    self.height[x] += 1

    def issame(self, x, y):
        return self.find(x) == self.find(y)


N = int(input())
P = [tuple(map(int, input().split())) for _ in range(N)]

lst = []
for p1, p2 in itertools.combinations(range(N), 2):
    dist = ceil_sq((P[p1][0] - P[p2][0]) ** 2 + (P[p1][1] - P[p2][1]) ** 2)
    lst.append((ceil(dist, 10) * 10, p1, p2))
lst.sort()

uf = UnionFind(N)
for dist, p1, p2 in lst:
    uf.unite(p1, p2)
    if uf.issame(0, N - 1):
        print(dist)
        break