#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const long long mod=998244353;
const long long mod2=469762049;
const long long mod100=1000000007;


struct Point{
    ll x,y;
};
bool operator<(const Point &a,const Point &b){
    if(a.x!=b.x) return a.x<b.x;
    return a.y<b.y;
}

ll dist(Point a,Point b){
    return max(abs(a.x-b.x),abs(a.y-b.y));
}

int main(){
    cout.tie()->sync_with_stdio(0);
    cin.tie(0);
    
    int N;cin>>N;
    Point P[N+1];
    for(int i=1;i<=N;i++){
        cin>>P[i].x>>P[i].y;
        ll a=P[i].x+P[i].y,b=P[i].x-P[i].y;
        P[i].x=a;
        P[i].y=b;
    }
    sort(P+1,P+N+1);
    Point dat[4];
    for(int i=0;i<4;i++) dat[i]=P[1];
    

    for(int i=1;i<=N;i++){
        chmin(dat[0].x,P[i].x);
        chmin(dat[1].x,P[i].x);
        chmax(dat[2].x,P[i].x);
        chmax(dat[3].x,P[i].x);

        chmin(dat[0].y,P[i].y);
        chmin(dat[2].y,P[i].y);
        chmax(dat[1].y,P[i].y);
        chmax(dat[3].y,P[i].y);
    }

    rep(i,4){
        //cout<<dat[i].x<<" "<<dat[i].y<<endl;
    }

    

    ll l=0,r=1e10;
    while(l!=r){
        ll m=(l+r)/2;
        bool check=false;
        for(int a=0;a<4;a++){
            for(int b=a+1;b<4;b++){
                bool f=true;
                for(int i=1;i<=N;i++){
                    ll d=min(dist(P[i],dat[a]),dist(P[i],dat[b]));
                    if(d>m){
                        f=false;
                        break;
                    }
                }
                if(f){
                    check=true;
                    break;
                }
            }
            if(check==true) break;
        }
        if(check) r=m;
        else l=m+1;
    }
    cout<<l<<endl;
}