#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
const double eps = 1e-8;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<class T> ostream& operator << (ostream& os, const set<T>& s) { for (auto si : s) os << si << " "; return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { (a += (b % mod + mod)) %= mod; }
template<class T> void operator += (vector<T>& v, vector<T> v2) { rep(i, sz(v2)) v.eb(v2[i]); }

void solve();

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(12);
    int T;
    T = 1;
    while (T--) solve();
}

int solve2(int n, vector<pii> v) {
    int ans = 0;
    rep(i, n) rep(j, i) chmax(ans, abs(v[i].F - v[j].F) + abs(v[i].S - v[j].S));
    return ans;
}

random_device rnd;
mt19937 mt(rnd());
uniform_int_distribution<> rand100(1, 10);
uniform_int_distribution<> rand200(1, 5);
#define rm rand100(mt)
#define rm2 rand200(mt)

void solve() {
    /*
    int n;
    n = rm;
    
    vector<pii> v(n), v2(n);
    rep(i, n) {
        int x, y;
        x = rm; y = rm;
        v[i] = pii(x, y);
        v2[i] = pii(y, x);
    }
     */
    
    int n;
    cin >> n;
    
    vector<pii> v(n), v2(n);
    rep(i, n) {
        int x, y;
        cin >> x >> y;
        v[i] = pii(x, y);
        v2[i] = pii(y, x);
    }
    
    sort(all(v));
    sort(all(v2));
    
    vector<pii> v3;
    {
        // xでsort
        v3.eb(v[0]);
        int ma = 0;
        rep(i, n) {
            if (v[i].F == v[0].F) chmax(ma, v[i].S);
        }
        v3.eb(v[0].F, ma);
        
        v3.eb(v[n - 1]);
        int mi = inf;
        rep(i, n) {
            if (v[i].F == v[n - 1].F) chmin(mi, v[i].S);
        }
        v3.eb(v[n - 1].F, mi);
    }
    
    {
        v3.eb(v2[0].S, v2[0].F); // v4.eb(v2[0]);
        int ma = 0;
        rep(i, n) {
            if (v2[i].F == v2[0].F) chmax(ma, v2[i].S);
        }
        v3.eb(ma, v2[0].F); // v4.eb(v2[0].F, ma);
        
        v3.eb(v2[n - 1].S, v2[n - 1].F); // v4.eb(v2[n - 1]);
        int mi = inf;
        rep(i, n) {
            if (v2[i].F == v2[n - 1].F) chmin(mi, v2[i].S);
        }
        v3.eb(mi, v2[n - 1].F); // v4.eb(v2[n - 1].F, mi);
    }
    
    // 片方でかくて片方小さい
    {
        int ma = 0;
        pii p = pii(-1, -1);
        rep(i, n) if (chmax(ma, v[i].F + (inf - v[i].S))) p = v[i];
        v3.eb(p);
    }
    
    {
        int ma = 0;
        pii p = pii(-1, -1);
        rep(i, n) if (chmax(ma, (inf - v[i].F) + v[i].S)) p = v[i];
        v3.eb(p);
    }
    
    {
        int ma = 0;
        pii p = pii(-1, -1);
        rep(i, n) if (chmax(ma, (inf - v[i].F) + (inf - v[i].S))) p = v[i];
        v3.eb(p);
    }
    
    {
        int ma = 0;
        pii p = pii(-1, -1);
        rep(i, n) if (chmax(ma, v[i].F + v[i].S)) p = v[i];
        v3.eb(p);
    }
    
    int ans = 0;
    rep(i, sz(v3)) rep(j, i) chmax(ans, abs(v3[i].F - v3[j].F) + abs(v3[i].S - v3[j].S));
    
    cout << ans << endl;
    /*
    int ans2 = solve2(n, v);
    if (ans != ans2) {
        cerr << "ans " << ans << " " << ans2 << endl;
        rep(i, sz(v3)) cerr << v3[i] << endl;
        cerr << n << endl;
        rep(i, n) cerr << v[i] << endl;
    }
     */
}


Measured memory_bytes: 6360