#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
using mint=modint998244353;
// g++ a.cpp -std=c++23 -I.
// g++ -std=c++23 -I. a.cpp -o main
// g++ -std=c++23 -I. anaive.cpp -o naive
// g++ -std=c++23 -I. agene.cpp -o gene



int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n;
    cin>>n;
    vl x(n);
    vl y(n);
    rep(i,0,n)cin>>x[i]>>y[i];
    vl a(n);
    vl b(n);
    rep(i,0,n){
        a[i]=x[i]+y[i];
        b[i]=x[i]-y[i];
    }
    ll ax=-10000000000;
    ll an=10000000000;
    ll bx=-10000000000;
    ll bn=10000000000;
    rep(i,0,n){
        ax=max(a[i],ax);
        an=min(a[i],an);
        bx=max(b[i],bx);
        bn=min(b[i],bn);
    }
    ll ans=max(ax-an,bx-bn);
    ll ansa=0;
    ll ansb=0;
    rep(i,0,n){
        ansa=max(ansa,min(max(abs(ax-a[i]),abs(bx-b[i])),max(abs(an-a[i]),abs(bn-b[i]))));
        ansb=max(ansb,min(max(abs(ax-a[i]),abs(bn-b[i])),max(abs(an-a[i]),abs(bx-b[i]))));
    }
    cout<<min(ansa,ansb)<<endl;
}