import math
N = int(input())
MAXDIST = 9*10**18 + 1

pos = []
for i in range(N):
    x, y = map(int, input().split())
    pos.append((x, y))

def distance(a, b):
    x0, y0 = pos[a]
    x1, y1 = pos[b]
    dd = (x1 - x0)*(x1 - x0) + (y1 - y0)*(y1 - y0)
    return math.sqrt(dd)
    #return dd

def distance2(a, b):
    x0, y0 = pos[a]
    x1, y1 = pos[b]
    dd = (x1 - x0)*(x1 - x0) + (y1 - y0)*(y1 - y0)
    #return math.sqrt(dd)
    return dd

def prim():
    parent = [-1]*(N+1)
    intree = [0]*(N+1)
    dist = [MAXDIST]*(N+1)


    src = 0
    dist[src] = 0
    while src >= 0 and src != N-1:
        intree[src] = 1
        mind = MAXDIST
        nxt = -1
        for k in range(N):
            if intree[k] == 0:
                dd = distance2(src, k)
                if dist[k] > max(dist[src], dd):
                    dist[k] = max(dist[src], dd)
                    parent[k] = src
                if dist[k] < mind:
                    mind = dist[k]
                    nxt = k
        #if nxt >= 0: parent[nxt] = src
        src = nxt

    if src < 0: #not found??
        return MAXDIST

    return dist[N-1]
    # #find max
    # ans = 0
    # while src != 0:
    #     pp = parent[src]
    #     dd = distance2(src, pp)
    #     if ans < dd:
    #         ans = dd
    #
    #     src = pp
    #
    # return ans

prm = prim()
ans = int(math.sqrt(prm))
while ans*ans < prm:
    ans = ans + 1

ans = math.ceil(ans/10) * 10
print(ans)