#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;

int a[100*1000];
int b[100*1000];
int N;
int main() {
	scanf("%d",&N);
	int mina=1<<30;
	int maxa=-(1<<30);
	int minb=1<<30;
	int maxb=-(1<<30);
	for(int i=0;i<N;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		a[i]=x+y;
		mina=min(mina,a[i]);
		maxa=max(maxa,a[i]);
		b[i]=x-y;
		minb=min(minb,b[i]);
		maxb=max(maxb,b[i]);
		//cout << a[i] << ", " << b[i] << endl;
	}
	int low=0;
	int hi=max(maxa-mina,maxb-minb);
	while(low+1<hi){
		int mid=(low+hi)/2;
		bool ok0=true;
		bool ok1=true;
		for(int i=0;(ok0||ok1)&&i<N;i++){
			if((a[i]-mina>mid||b[i]-minb>mid)&&
			   (maxa-a[i]>mid||maxb-b[i]>mid)){
				ok0=false;
			}
			if((a[i]-mina>mid||maxb-b[i]>mid)&&
			   (maxa-a[i]>mid||b[i]-minb>mid)){
				ok1=false;
			}
		}
		if(ok0||ok1){
			hi=mid;
		}
		else{
			low=mid;
		}
	}
	printf("%d\n",hi);
}