#include<bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << ": " << (x) << endl
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define dwn(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()
 
#define x first
#define y second
using pii = pair<int, int>;
using ll = long long;
 
inline void read(int &x){
    int s=0; x=1;
    char ch=getchar();
    while(ch<'0' || ch>'9') {if(ch=='-')x=-1;ch=getchar();}
    while(ch>='0' && ch<='9') s=(s<<3)+(s<<1)+ch-'0',ch=getchar();
    x*=s;
}

const int N=1010;

int n;
pii w[N];

int cal(vector<pii> &a){
	int res=0, n=a.size();
	rep(i, 0, n-1) rep(j, i+1, n-1) res=max(res, max(abs(a[i].x-a[j].x), abs(a[i].y-a[j].y)));
	return res;
}

// bool inb[N];
set<int> b;

bool ok(int g){
	vector<int> a;
	// rep(i, 1, n) inb[i]=true;
	b.clear();
	rep(i, 2, n) b.insert(i);
	a.pb(1);
	rep(i, 2, n){
		if(w[i].x>w[1].x+g) break;
		else a.pb(i);
	}
	sort(all(a), [&](int fir, int sec){
		return w[fir].y<w[sec].y;
	});
	// for(auto e: b) debug(e);
	
	vector<pii> buf;
	
	int m=a.size();
	// inb[a[0]]=false;
	b.erase(a[0]);
	for(int l=0, r=0; l<m; l++){
		while(r+1<m && w[a[r+1]].y-w[a[l]].y<=g){
			r++;
			// inb[a[r]]=false;
			b.erase(a[r]);
		}
		
		buf.clear();
		for(auto e: b) buf.pb(w[e]);
		// for(auto e: b) cerr<<e<<" ";
		// cerr<<endl;
		if(cal(buf)<=g) return true;
		
		// inb[a[l]]=true;
		b.insert(a[l]);
	}
	return false;
}

signed main(){
	cin>>n;
	rep(i, 1, n){
		int x, y; read(x), read(y);
		w[i]={x+y, x-y};
	}
	sort(w+1, w+1+n);
	// rep(i, 1, n) cerr<<w[i].x<<" "<<w[i].y<<"\n";
	// debug(ok(7));
	// debug("=======");
	
	int l=0, r=2020;
	while(l<r){
		int mid=l+r>>1;
		if(ok(mid)) r=mid;
		else l=mid+1;
	}
	cout<<l<<endl;
	
	return 0;
}