ll@n,a[n],b[n];
rep(i,n){
	ll@x,@y;
	a[i]=x+y;
	b[i]=x-y+999;
}
ll@m,c[m],d[m];
rep(i,m){
	ll@z,@w;
	c[i]=z+w;
	d[i]=z-w+999;
}
ll o=-1,h=2d3;
while(o<h-1){
	ll v=o+h>>1;
	int f[2d3][2d3]{};
	rep(i,n){
		ll x0=max(a[i]-v,0);
		ll x1=min(a[i]+v+1,2d3-1);
		ll y0=max(b[i]-v,0);
		ll y1=min(b[i]+v+1,2d3-1);
		f[y0][x0]+=1;
		f[y0][x1]-=1;
		f[y1][x0]-=1;
		f[y1][x1]+=1;
	}
	rep(y,2d3){
		ll e=0;
		rep(x,2d3){
			f[y][x]=e+=f[y][x];
		}
	}
	rep(x,2d3){
		ll e=0;
		rep(y,2d3){
			f[y][x]=e+=f[y][x];
		}
	}
	bool found=false;
	rep(i,m){
		if(f[d[i]][c[i]]){
			found=true;
		}
	}
	(found?h:o)=v;
}
wt(h);