#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<ll> x(n), y(n);
    for(int i = 0; i < n; i++){
        ll X, Y; cin >> X >> Y;
        x[i] = X+Y;
        y[i] = X-Y;
    }
    ll x_min = *min_element(x.begin(), x.end());
    ll x_max = *max_element(x.begin(), x.end());
    ll y_min = *min_element(y.begin(), y.end());
    ll y_max = *max_element(y.begin(), y.end());
    auto ok = [&](ll d) -> bool{
        vector<bool> ok(n);
        auto in_upper = [&](ll x){
            return x_min <= x && x <= x_min+d*2;
        };
        auto in_lower = [&](ll x){
            return x_max-2*d <= x && x <= x_max;
        };
        auto in_left = [&](ll y){
            return y_min <= y && y <= y_min+d*2;
        };
        auto in_right = [&](ll y){
            return y_max-2*d <= y && y <= y_max;
        };
        int ok_sum = 0;
        for(int i = 0; i < n; i++){
            if(in_upper(x[i]) && in_left(y[i])) ok[i] = true;
            if(in_lower(x[i]) && in_right(y[i])) ok[i] = true;
            if(ok[i]) ok_sum++;
        }
        if(ok_sum == n) return true;
        ok.assign(n, false);
        for(int i = 0; i < n; i++){
            if(in_upper(x[i]) && in_right(y[i])) ok[i] = true;
            if(in_lower(x[i]) && in_left(y[i])) ok[i] = true;
            if(!ok[i]) return false;
        }
        return true;
    };
    if(ok(0)){
        cout << 0 << endl;
        return 0;
    }
    ll l = 0, r = 1e10;
    while(r-l > 1){
        ll d = (l+r)/2;
        if(ok(d)) r = d;
        else l = d;
    }
    cout << r << endl;
}