import sys
input = sys.stdin.readline

N = int(input())
P = [list(map(int, input().split())) for _ in [0] * N]

dist = []
for i in range(N - 1):
	for j in range(i + 1, N):
		d = abs(P[i][0] - P[j][0]) + abs(P[i][1] - P[j][1])
		dist.append((d, i, j))
dist.sort(reverse = True)

def func(route):
	c = [0] * N
	for v in range(N):
		if(c[v]):
			continue
		c[v] = 1
		que = [v]
		while(que):
			now = que.pop()
			for nv in route[now]:
				if(c[nv] == 0):
					c[nv] = -c[now]
					que.append(nv)
				elif(c[nv] == c[now]):
					return False
	return True

ok = 0
ng = N * (N - 1) // 2 + 1
while(ng - ok > 1):
	k = (ok + ng) // 2
	route = [[] for _ in [0] * N]
	for _, i, j in dist[:k]:
		route[i].append(j)
		route[j].append(i)
	if(func(route)):
		ok = k
	else:
		ng = k

ans = dist[ok][0] // 2 if(ok < N * (N - 1) // 2) else 0
print(ans)