#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N;
    cin >> N;
    vector<ll> X(N);
    vector<ll> Y(N);
    rep(i, N){
        cin >> X[i] >> Y[i];
    }
    // 2 個の正方形で覆えますか？　問題になる
    vector<pll> p(N);
    rep(i, N){
        p[i].first = X[i] - Y[i];
        p[i].second = X[i] + Y[i];
    }
    sort(all(p));

    ll INF = 10000000000023LL;

    ll ng = -1;
    ll ok = INF;
    while (ok - ng > 1){
        ll mid = (ok + ng) / 2;
        // まず、1 個目をどこまで伸ばせるかを求める
        ll min_x = p[0].first;
        ll max_x = p[0].first;

        ll max_y = -INF;
        ll min_y = INF;
        ll id = -1;
        for (ll i = 0; i < N; i++){
            max_x = p[i].first;
            max_y = max(max_y, p[i].second);
            min_y = min(min_y, p[i].second);
            if (max_y - min_y > mid || max_x - min_x > mid){
                break;
            }
            id = i;
        }

        // 残りを 2 個目で覆えるか確かめる
        if (id == N - 1){
            ok = mid;
            continue;
        }
        min_x = p[id + 1].first;
        max_x = p[id + 1].first;
        min_y = INF;
        max_y = -INF;
        for (ll i = id + 1; i < N; i++){
            max_x = max(max_x, p[i].first);
            min_y = min(min_y, p[i].second);
            max_y = max(max_y, p[i].second);
        }
        if (max_x - min_x <= mid && max_y - min_y <= mid){
            ok = mid;
        }
        else{
            ng = mid;
        }
    }
    cout << ok << endl;
}