N=int(input())
dist=[]
for i in range(2002):
  dist.append([0]*2002)
for i in range(N):
  x,y=list(map(int,input().split()))
  dist[x+y+1][x-y+1000+1]+=1
for i in range(2002):
  for j in range(1,2002):
    dist[i][j]+=dist[i][j-1]
for i in range(2002):
  for j in range(1,2002):
    dist[j][i]+=dist[j-1][i]
  
def wa(a,b,c,d):
  return dist[c][d]-dist[a-1][d]-dist[c][b-1]+dist[a-1][b-1]

ans=2002
M=int(input())
for i in range(M):
  x,y=list(map(int,input().split()))
  z=x+y+1
  w=x-y+1000+1
  ok=2001
  ng=-1
  while abs(ok-ng)>1:
    m=(ok+ng)//2
    #print(wa(max(1,z-m),max(1,w-m),min(z+m,2001),min(w+m,2001)),m)
    if wa(max(1,z-m),max(1,w-m),min(z+m,2001),min(w+m,2001))>0:
      ok=m
    else:
      ng=m
  ans=min(ans,ok)
print(ans)