#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


ll N;
ll X[101010],Y[101010];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>x>>y;
		X[i]=x+y;
		Y[i]=x-y;
	}
	
	if(N<=2) {
		cout<<0<<endl;
		return;
	}
	
	
	ll ret=1LL<<60;
	FOR(k,2) {
		vector<pair<ll,ll>> Vs;
		FOR(i,N) Vs.push_back({X[i],Y[i]});
		sort(ALL(Vs));
		multiset<ll> AY,BY;
		FOR(i,N) BY.insert(Vs[i].second);
		
		FOR(i,N-1) {
			BY.erase(BY.find(Vs[i].second));
			AY.insert(Vs[i].second);
			ll mi=max({Vs[i].first-Vs[0].first,Vs.back().first-Vs[i+1].first,*BY.rbegin()-*BY.begin(),*AY.rbegin()-*AY.begin()});
			ret=min(mi,ret);
		}
		
		
		
		
		
		
		FOR(i,N) swap(X[i],Y[i]);
	}
	cout<<ret/2<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}