京东 0914

import math
n = int(input())
city = []
for _ in range(n):
    x,y = map(int, input().split())
    city.append((x,y))
def dist(c1,c2):
  disx = (c1[0]-c2[0])**2
  disy = (c1[1]-c2[1])**2
  return (disx + disy)**0.5
# for i in range(n):
#     for j in range(n):
#         if i == j or j < i:
#             path[i][j] = path[j][i]
#         else:
#             path[i][j] = dist(city[i], city[j])
# prim
choose = {0}
lowCost= [float('inf')] + [dist(city[0], city[i]) for i in range(1,n)]
res = 0
while len(choose) < n:
    mi = min(lowCost)
    res = max(res, mi)
    mi_idx = lowCost.index(mi)
    choose.add(mi_idx)
    lowCost[mi_idx] = float('inf')
    # 更新lowCost
    for i in range(n):
        if i not in choose:
            lowCost[i] = min(lowCost[i], dist(city[i], city[mi_idx]))
print(math.ceil(res/2))

# 3
# 0 0
# 0 5
# 6 0

# 2
# 0 0
# 1 0

正确答案分别为3 和 1