#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*) array, (T*) (array + N), val);
}
pii Dir [] = {
	{ 0, 1 },{ -1 ,1 },{ -1, 0 },
	{ -1 ,-1 },{ 0,-1 },{ 1 ,-1 },
	{ 1,0 },{ 1 ,1 }
};

signed main() {
	int n;
	scnaf("%d", &n);
	vector<pii> q(n);
	vector<pii> fh, fr;
	REP(i, n) {
		int a, b;
		scanf("%d %d", &a, &b);
		q[i] = { a,b };
	}
	pii xm = { INT_MIN,INT_MAX }, ym = { INT_MIN,INT_MAX };
	REP(i, n) {
		q[i] = { q[i].first + q[i].second, q[i].second - q[i].first };
		xm.first = max(xm.first, q[i].second);
		xm.second = min(xm.second, q[i].second);
		ym.first = max(ym.first, q[i].first);
		ym.second = min(ym.second, q[i].first);
	}
	REP(i, n) {
		fh.push_back({ max(q[i].first - ym.second, q[i].second - xm.second),i });
		fr.push_back({ max(ym.first - q[i].first, xm.first - q[i].second),i });
	}
	int wi = max(xm.first - xm.second, ym.first - ym.second);
	sort(ALL(fh));
	sort(ALL(fr));
	int ans = 0;
	vector<bool> used(n);
	int cou = 0;
	int fhc = 0, frc = 0;
	REP(i, wi + 1) {
		for (; fhc < fh.size(); fhc++) {
			if (fh[fhc].first <= i) {
				if (!used[fh[fhc].second]) {
					used[fh[fhc].second] = 1;
					cou++;
				}
			}
			else
				break;
		}
		for (; frc < fr.size(); frc++) {
			if (fr[frc].first <= i) {
				if (!used[fr[frc].second]) {
					used[fr[frc].second] = 1;
					cou++;
				}
			}
			else
				break;
		}

		if (cou == n) {
			ans = i;
			break;
		}
	}


	fh.clear();
	fr.clear();
	REP(i, n) {
		fh.push_back({ max(q[i].first - ym.second, xm.first - q[i].second),i });
		fr.push_back({ max(ym.first - q[i].first, q[i].second - xm.second),i });
	}
	sort(ALL(fh));
	sort(ALL(fr));
	used = vector<bool>(n);
	cou = 0;
	fhc = 0; frc = 0;
	REP(i, wi + 1) {
		for (; fhc < fh.size(); fhc++) {
			if (fh[fhc].first <= i) {
				if (!used[fh[fhc].second]) {
					used[fh[fhc].second] = 1;
					cou++;
				}
			}
			else
				break;
		}
		for (; frc < fr.size(); frc++) {
			if (fr[frc].first <= i) {
				if (!used[fr[frc].second]) {
					used[fr[frc].second] = 1;
					cou++;
				}
			}
			else
				break;
		}

		if (cou == n) {
			ans = min(ans, i);
			break;
		}
	}
	printf("%d\n", ans);
	return 0;
}

Measured memory_bytes: 5504