#ifndef AUTO_UTIL_HEADER_HPP
#define AUTO_UTIL_HEADER_HPP

#include <bits/stdc++.h>
#include <cassert>

using std::cin, std::cout, std::bitset, std::complex;
using std::vector, std::array, std::string, std::pair, std::list, std::queue, std::deque;
using std::priority_queue, std::set, std::map, std::unordered_map;
using std::sort, std::greater, std::min, std::max, std::reverse;
using std::min_element, std::max_element, std::accumulate;

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ull = unsigned long long int;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-7;
#define Loop(i, n) for(int i = 0; i < int(n); i++)
#define Loopll(i, n) for(ll i = 0; i < ll(n); i++)
#define Loop1(i, n) for(int i = 1; i <= int(n); i++)
#define Loopll1(i, n) for(ll i = 1; i <= ll(n); i++)
#define Loopr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = ll(n) - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = int(n); i >= 1; i--)
#define Looprll1(i, n) for(ll i = ll(n); i >= 1; i--)
#define Foreach(buf, container) for(const auto &buf : container)
#define Foreachr(buf, container)  for(const auto &buf : reversed(container))
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define quickio() std::ios::sync_with_stdio(false); std::cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
bool feq(double x, double y) { return abs(x - y) <= eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vll xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int m = int(log2(x)); return m + ((1LL << m) < x ? 1 : 0); }
int floorlog2(ll x) { int m = int(log2(x)); return m - ((1LL << m) > x ? 1 : 0); }
const string endl = "\n";
template<class T> T reversed(T container) { reverse(container.begin(), container.end()); return container; }
template<class T> void printv(const vector<T> &v) { for (const T &x : v) cout << x << " "; cout << endl; }
template<class T> void printmx(const vector<vector<T>> &mx) { for (const vector<T> &v : mx) printv(v); }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m*  m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return ll(m) * ll(n) / gcd(m, n); }

#endif // AUTO_UTIL_HEADER_HPP

//========================================================================//

// #define ENABLE_UPD
class SegTreeMax {
	using val_t = ll;
	static const val_t VALMIN = LLONG_MIN;
	static const int IDXMAX = INT_MAX;
private:
	struct idxval_t {
		int idx;
		val_t val;
		bool operator<(const idxval_t &another) const {
			return val != another.val ? val < another.val : idx > another.idx;
		}
	};
	struct segval_t {
		bool enable;
		val_t upd, add;
		idxval_t max;
	};
	int n, N; // n is the original size, while N is the extended size
	int base;
	vector<segval_t> nodes;
	vi idl, idr;
	void merge(int id) {
		val_t val_l = nodes[idl[id]].max.val + nodes[idl[id]].add;
		val_t val_r = nodes[idr[id]].max.val + nodes[idr[id]].add;
		nodes[id].max.idx = (val_l >= val_r ? nodes[idl[id]].max.idx : nodes[idr[id]].max.idx);
		nodes[id].max.val = std::max(val_l, val_r);
	}
#ifdef ENABLE_UPD
	void lazy(int id, int l, int r) {
		if (id >= base) return;
		if (nodes[id].enable) {
			val_t upd = nodes[id].upd + nodes[id].add;
			nodes[idl[id]] = { true, upd, 0, {l, upd} };
			nodes[idr[id]] = { true, upd, 0, {(l + r) >> 1, upd} };
			nodes[id] = { false, 0, 0, {l, upd} };
		}
		else {
			nodes[idl[id]].add += nodes[id].add;
			nodes[idr[id]].add += nodes[id].add;
			nodes[id].add = 0;
			merge(id);
		}
	}
#endif
	enum change_t {
		ADD,
#ifdef ENABLE_UPD
		UPD
#endif
	};
	void change_rec(int s, int t, int l, int r, int id, val_t x, change_t op) {
		if (s == l && t == r) {
#ifdef ENABLE_UPD
			if (op == ADD) nodes[id].add += x;
			else if (op == UPD) nodes[id] = { true, x, 0, {s, x} };
#else
			nodes[id].add += x;
#endif
		}
		else {
#ifdef ENABLE_UPD
			lazy(id, l, r);
#endif
			int m = (l + r) >> 1;
			if (s < m && m < t) {
				change_rec(s, m, l, m, idl[id], x, op);
				change_rec(m, t, m, r, idr[id], x, op);
			}
			else if (s < m) {
				change_rec(s, t, l, m, idl[id], x, op);
			}
			else if (m < t) {
				change_rec(s, t, m, r, idr[id], x, op);
			}
			merge(id);
		}
	}
	idxval_t solve_rec(int s, int t, int l, int r, int id) {
		idxval_t v;
		if (s == l && t == r) {
			v = nodes[id].max;
		}
		else {
#ifdef ENABLE_UPD
			lazy(id, l, r);
#endif
			int m = (l + r) >> 1;
			if (s < m && m < t) {
				idxval_t v0 = solve_rec(s, m, l, m, idl[id]);
				idxval_t v1 = solve_rec(m, t, m, r, idr[id]);
				v = std::max(v0, v1);
			}
			else if (s < m) {
				v = solve_rec(s, t, l, m, idl[id]);
			}
			else if (m < t) {
				v = solve_rec(s, t, m, r, idr[id]);
			}
		}
		v.val += nodes[id].add;
		return v;
	}
	void common_init() {
		idl.resize(base + N, -1);
		idr.resize(base + N, -1);
		Loop(i, base) {
			idl[i] = (i << 1) + 1;
			idr[i] = (i << 1) + 2;
		}
	}
public:
	SegTreeMax(int n, val_t init = LLONG_MIN) {
		this->n = n;
		this->N = 1 << ceillog2(n);
		this->base = N - 1;
		this->nodes = vector<segval_t>(base + N, { false, 0, 0, {IDXMAX, VALMIN} });
		common_init();
		Loop(i, n) {
			this->nodes[base + i] = { true, init, 0, {i, init} };
		}
		Loopr(i, base) {
			merge(i);
		}
	}
	SegTreeMax(const vector<val_t> &a) {
		this->n = int(a.size());
		this->N = 1 << ceillog2(n);
		this->base = N - 1;
		this->nodes = vector<segval_t>(base + N, { false, 0, 0, {IDXMAX, VALMIN} });
		common_init();
		Loop(i, n) {
			nodes[base + i] = { true, a[i], 0, {i, a[i]} };
		}
		Loopr(i, base) {
			merge(i);
		}
	}
#ifdef ENABLE_UPD
	void upd(int s, int t, val_t x) {
		if (s >= t) return;
		change_rec(s, t, 0, N, 0, x, UPD);
	}
#endif
	void add(int s, int t, val_t x) {
		if (s >= t) return;
		change_rec(s, t, 0, N, 0, x, ADD);
	}
	// the smallest argmax_i\in[s, t) a[i]
	int maxidx(int s, int t) {
		if (s >= t) return IDXMAX;
		return solve_rec(s, t, 0, N, 0).idx;
	}
	val_t maxval(int s, int t) {
		if (s >= t) return VALMIN;
		return solve_rec(s, t, 0, N, 0).val;
	}
	// the smallest argmax_i\in[s, t) a[i], and its value
	idxval_t maxidxval(int s, int t) {
		if (s >= t) return {IDXMAX, VALMIN};
		return solve_rec(s, t, 0, N, 0);
	}
};
#undef ENABLE_UPD

ll solve(vector<Pll> as, vector<Pll> bs) {
    std::sort(as.begin(), as.end());
    std::sort(bs.begin(), bs.end());
    Pll base = {LLONG_MAX, LLONG_MAX};
    for (const auto &a : as) {
        base.fst = min(base.fst, a.fst);
        base.snd = min(base.snd, a.snd);
    }
    for (const auto &b : bs) {
        base.fst = min(base.fst, b.fst);
        base.snd = min(base.snd, b.snd);
    }
    vll vs(bs.size());
    Loop(i, bs.size()) {
        vs[i] = bs[i].fst - base.fst + bs[i].snd - base.snd;
    }
    SegTreeMax *stm = new SegTreeMax(vs);
    vector<Pll> cs(bs.size());
    Loop(i, cs.size()) {
        cs[i] = {bs[i].snd, bs[i].fst};
    }
    std::reverse(cs.begin(), cs.end());
    ll ans = 0;
    Loop(i, as.size()) {
        ll u = as[i].fst - base.fst + as[i].snd - base.snd;
        int l = std::lower_bound(bs.begin(), bs.end(), Pll({as[i].fst, as[i].snd})) - bs.begin();
        int r = cs.size() - (std::lower_bound(cs.begin(), cs.end(), Pll({as[i].snd, as[i].fst})) - cs.begin());
        ans = std::max(ans, stm->maxval(l, r) - u);
    }
    delete stm;
    return ans;
}

int main() {
    quickio();
    int n; cin >> n;
    vector<Pll> as(n);
    Loop(i, n) cin >> as[i].fst >> as[i].snd;
    vector<vector<Pll>> lst(4);
    Loop(k, 4) {
        vector<Pll> bs(n);
        int sign0 = (k & 0b01 ? -1 : 1);
        int sign1 = (k & 0b10 ? -1 : 1);
        Loop(i, n) bs[i] = {as[i].fst * sign0, as[i].snd * sign1};
        std::sort(bs.begin(), bs.end());
        vector<Pll> ld; ld.push_back(bs[0]);
        Loop(i, n) {
            if (bs[i].snd < ld.back().snd) {
                ld.push_back(bs[i]);
            }
        }
        Loop(i, ld.size()) {
            ld[i].fst *= sign0;
            ld[i].snd *= sign1;
        }
        lst[k] = ld;
    }
    ll ans0 = solve(lst[0], lst[3]);
    Loop(i, lst[1].size()) {
        lst[1][i].fst *= -1;
    }
    Loop(i, lst[2].size()) {
        lst[2][i].fst *= -1;
    }
    ll ans1 = solve(lst[1], lst[2]);
    cout << max(ans0, ans1) << endl;
}


Measured memory_bytes: 41504