#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize(2)
struct node{int x,y;} p[200005];
int d[200005];
int dis(node a,node b){
	return abs(a.x-b.x)+abs(a.y-b.y);
}
signed main(){
	int n;
	bool v=0;
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%lld%lld",&p[i].x,&p[i].y);
		if(p[i].y) v=1;
	}
	if(n<=3000){
		int mx=INT_MIN;
		for(int i=1;i<=n;i++)
			for(int j=i+1;j<=n;j++)
				mx=max(mx,dis(p[i],p[j]));
		cout<<mx;
	}
	else if(!v){
		int mx=INT_MIN,mn=INT_MAX;
		for(int i=1;i<=n;i++)
			mx=max(mx,p[i].x),mn=min(mn,p[i].x);
		cout<<abs(mx-mn);
	}
	else{
		int mx=INT_MIN;
		for(int i=1;i<=n;i++) d[i]=p[i].x+p[i].y;
		sort(d+1,d+n+1);
		mx=max(mx,abs(d[n]-d[1]));
		for(int i=1;i<=n;i++) d[i]=p[i].x-p[i].y;
		sort(d+1,d+n+1);
		mx=max(mx,abs(d[n]-d[1]));
		for(int i=1;i<=n;i++) d[i]=-p[i].x+p[i].y;
		sort(d+1,d+n+1);
		mx=max(mx,abs(d[n]-d[1]));
		for(int i=1;i<=n;i++) d[i]=-p[i].x-p[i].y;
		sort(d+1,d+n+1);
		mx=max(mx,abs(d[n]-d[1]));
		cout<<mx;
	}
	return 0;
}