#include <bits/stdc++.h>
using namespace std;

#define all(v) (v).begin(),(v).end()
#define pb emplace_back
#define rep(i, n) for(int i=0;i<(n);i++)
#define foa(e, v) for(auto& e : v)
#define dout(a) cout<<fixed<<setprecision(10)<<a<<'\n';
#define Cout(a) cout<<a<<'\n';

using ll = long long;
using ld = long double;
using Int = __int128;
template <class T> using pqr = priority_queue<T, vector<T>, greater<T>>;

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
    bool compare = a < b;
    if(compare) a = b;
    return compare;
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
    bool compare = a > b;
    if(compare) a = b;
    return compare;
}
template <typename T> inline T back(std::set<T> &s) {
    return *s.rbegin();
}
template <typename T> inline T back(std::multiset<T> &s) {
    return *s.rbegin();
}
template <typename T> inline T pop_back(std::set<T> &s) {
    auto it = prev(s.end());
    T val = *it;
    s.erase(it); 
    return val;
}
template <typename T> inline T pop_back(std::multiset<T> &s) {
    auto it = prev(s.end());
    T val = *it;
    s.erase(it); 
    return val;
}

const int dy[8] = {-1, 0, 0, 1, 1, -1, 1, -1};
const int dx[8] = {0, -1, 1, 0, -1, -1, 1, 1};

const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (3LL << 59);
const int inf = 1 << 30;
const char br = '\n';

void solve() {
    ll n; cin >> n;
    vector<ll> x(n), y(n);
    rep(i, n) cin >> x[i] >> y[i];
    {
        vector<ll> a, b;
        rep(i, n) {
            a.pb(x[i] - y[i] + MOD7);
            b.pb(x[i] + y[i]);
        }
        swap(x, a);
        swap(y, b);
    }
    ll ri = (1LL << 40), le = -1;
    ll mi = *min_element(all(x));
    ll ma = *max_element(all(x));

    ll Ma = *max_element(all(y));
    ll Mi = *min_element(all(y));
    while(ri - le > 1) {
        ll mid = (ri + le)/2;
        
        int flag = 0;
        {
            vector<int> ok(n, 0);
            rep(i, n) {
                if(Ma - mid <= y[i] and mi + mid >= x[i]) ok[i] = 1;
                else if(Mi + mid >= y[i] and ma - mid <= x[i]) ok[i] = 1;
            }
            if(!count(all(ok), 0)) flag = 1;
        }{
            vector<int> ok(n, 0);
            rep(i, n) {
                if(Mi + mid >= y[i] and mi + mid >= x[i]) ok[i] = 1;
                else if(Ma - mid <= y[i] and ma - mid <= x[i]) ok[i] = 1;
            }
            if(!count(all(ok), 0)) flag = 1;
        }
        if(flag) ri = mid;
        else le = mid;
    }
    cout << ri << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int testcase = 1; 
    // cin >> testcase;
    while(testcase --) solve();

    return 0;
}