#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


void solve();
// TOMOSHI BEAT
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<pair<ll,ll>> p(N);
	rep(i,N){
		ll x,y;
		cin>>x>>y;
		p[i]={x+y,x-y};
	}
	if(N<=2){
		cout<<"0\n";
		return ;
	}
	So(p);
	ll l=-1,r=INF;
	while(r-l>1){
		ll med=(l+r)/2;
		int J=0;
		ll A=ILL,B=-ILL;
		rep(i,N){
			if(i==0) continue;
			if(max(abs(p[i].second-p[0].second),abs(p[i].first-p[0].first))<=med*2){
				chmin(A,p[i].second);
				chmax(B,p[i].second);
			}
		}
		vector<ll> CY={A+med,B-med};
		rep(roop,2){
			ll C=ILL,D=-ILL,E=ILL,F=-ILL;
			rep(i,N){
				if(max(abs(p[0].first+med-p[i].first),abs(CY[roop]-p[i].second))>med){
					chmin(C,p[i].first);
					chmax(D,p[i].first);
					chmin(E,p[i].second);
					chmax(F,p[i].second);
				}
			}
			if(max(D-C,F-E)<=med*2) J=1;
		}
		if(J) r=med;
		else l=med;
	}
	cout<<r<<"\n";
}