#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std; using ll = long long; using ld = long double;  using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vlll = vector<vll>; using vpll = vector<pll>;
using vs = vector<string>; using tll = tuple<ll, ll, ll>; using vtll = vector<tll>;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define co(i) cout << i << endl;
#define co2(i,j) cout << i << " " << j << endl;
#define co3(i) cout << i << " ";
#define po(i) cout << i.first << " " << i.second << endl;
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
	cerr << " " << h;
	if (sizeof...(t) > 0) cerr << " :";
	debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
	for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
	return firstElof.second < secondElof.second;
}
//AtCoder以外ではコメントアウトを忘れずに！
//#include <atcoder/all>
//using namespace atcoder;
//**Snippetリスト**//
//rep, vin, all, iteLoop, bitSearch, bitList, nod, LIS, digitDP, treeDP, Rerooting//
//gcdlcm, isPrime, eratos, primeFactorize, Npow, combination, divisor, modinv, doubling//
//dfs, bfs, dijkstra, WarshallFloyd, BellmanFord, UnionFind, Kruskal, RMQ, LCA, FordFulkerson//
ll i, j, k, l; ll N, M, K, H, W, X, Y, Z, R, Q, T;
ll MOD = 1000000007, INF = 1LL << 60, ans = 0, z = 0, o = 1;
vl flag, D; vll path; vs S;
//***********//
/* RMQ：[0,n-1] について、区間ごとの最小値を管理する構造体
    set(int i, T x), build(): i番目の要素をxにセット。まとめてセグ木を構築する。O(n)
    update(i,x): i 番目の要素を x に更新。O(log(n))
    query(a,b): [a,b) での最小の要素を取得。O(log(n))
    find_rightest(a,b,x): [a,b) で x以下の要素を持つ最右位置を求める。O(log(n))
    find_leftest(a,b,x): [a,b) で x以下の要素を持つ最左位置を求める。O(log(n))
*/
template <typename T>
struct RMQ {
    const T e = numeric_limits<T>::max();
    ll n;
    vector<T> dat;
    RMQ(ll n_) : n(), dat(n_ * 4, e) {
        ll x = 1;
        while (n_ > x) x *= 2;
        n = x;
    }
    void set(ll i, T x) { dat[i + n - 1] = x; }
    void build() {
        for (ll k = n - 2; k >= 0; k--) dat[k] = min(dat[2 * k + 1], dat[2 * k + 2]);
    }
    void update(ll i, T x) {
        i += n - 1; dat[i] = x;
        while (i > 0) {
            i = (i - 1) / 2;  // parent
            dat[i] = min(dat[i * 2 + 1], dat[i * 2 + 2]);
        }
    }
    // the minimum element of [a,b)
    T query(ll a, ll b) { return query_sub(a, b, 0, 0, n); }
    T query_sub(ll a, ll b, ll k, ll l, ll r) {
        if (r <= a || b <= l) return e;
        else if (a <= l && r <= b) return dat[k];
        else {
            T vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
            T vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
            return min(vl, vr);
        }
    }
    T find_rightest(ll a, ll b, ll x) { return find_rightest_sub(a, b, x, 0, 0, n); }
    T find_leftest(ll a, ll b, ll x) { return find_leftest_sub(a, b, x, 0, 0, n); }
    T find_rightest_sub(ll a, ll b, ll x, ll k, ll l, ll r) {
        // 自分の値がxより大きい or [a,b)が[l,r)の範囲外ならreturn a-1
        if (dat[k] > x || r <= a || b <= l) return a - 1;
        // 自分が葉ならその位置をreturn
        else if (k >= n - 1) return (k - (n - 1));
        else {
            ll vr = find_rightest_sub(a, b, x, 2 * k + 2, (l + r) / 2, r);
            // 右の部分木を見て a-1 以外ならreturn
            if (vr != a - 1) return vr;
            // 左の部分木を見て値をreturn
            else return find_rightest_sub(a, b, x, 2 * k + 1, l, (l + r) / 2);
        }
    }
    T find_leftest_sub(ll a, ll b, ll x, ll k, ll l, ll r) {
        // 自分の値がxより大きい or [a,b)が[l,r)の範囲外ならreturn b
        if (dat[k] > x || r <= a || b <= l) return b;
        // 自分が葉ならその位置をreturn
        else if (k >= n - 1) return (k - (n - 1));
        else {
            ll vl = find_leftest_sub(a, b, x, 2 * k + 1, l, (l + r) / 2);
            // 左の部分木を見て b 以外ならreturn
            if (vl != b) return vl;
            // 右の部分木を見て値をreturn
            else return find_leftest_sub(a, b, x, 2 * k + 2, (l + r) / 2, r);
        }
    }
};
int main() {
	cin >> N;
	vpll P(N);
    vl X(N), Y(N);
    map<ll, ll> Xm, Ym;
	for (i = 0; i < N; i++) {
		cin >> P[i].first >> P[i].second;
	}
    vpll Q = P;
    sort(P.begin(), P.end());
    sort(Q.begin(), Q.end(),pairCompare);
    RMQ<ll> T1(N), T2(N);
    for (i = 0; i < N; i++) {
        T1.update(i, -(Q[i].first + Q[i].second));
        T2.update(i, -(Q[i].first - Q[i].second));
    }
    for (i = 0; i < N; i++) {
        ll x = P[i].first;
        ll y = P[i].second;
        ll left = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
        ll right = Q.size(); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は V.size()
        while (right - left > 1) {
            ll mid = left + (right - left) / 2;
            if (Q[mid].second >= y) right = mid;
            else left = mid;
        }
        ll idx = right;//right以上はT1で見る
        ll R = T1.query(idx, N);
        ll L = T2.query(0, idx);
        ll pre1 = -R - x - y;
        ll pre2 = -L - x + y;
        //debug(R,L,pre1, pre2);
        if(idx<N) ans = max(ans, pre1);
        if(idx!=0) ans = max(ans, pre2);
    }
    co(ans);
}


Measured memory_bytes: 25188