#include <math.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define print(n) cout << (n) << endl
#define fprint(n) cout << setprecision(16) << (n) << endl
#define ceil_div(a, b) (((a) - 1) / (b) + 1)
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define itrep(itr, st) for (auto itr = st.begin(); itr != st.end(); itr++)
#define ite(i, a) for (auto& i : a)
#define all(x) x.begin(), x.end()
#define lb(A, x) (lower_bound(all(A), x) - A.begin())
#define ub(A, x) (upper_bound(all(A), x) - A.begin())
using str = string;
using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using Pair = pair<int, int>;
using mint = modint1000000007;
using Mint = modint998244353;
template <class T>	using V = vector<T>;
template <class T>	using VV = V<V<T> >;
template <class T>	using PQ = priority_queue<T, V<T>, greater<T> >;
template <class T>	using PQR = priority_queue<T>;
template <class T>	using BIT = fenwick_tree<T>;
const ll INF = 4611686018427387903;
const int inf = 2147483647;
const ll mod = 1000000007;
const ll MOD = 998244353;
template <class T>  inline V<T> getList(int n) { V<T> res(n); rep(i, 0, n) { cin >> res[i]; }return res; }
template <class T>  inline VV<T> getGrid(int m, int n) { VV<T> res(m, V<T>(n)); rep(i, 0, m) { res[i] = getList<T>(n); }return res; }
template <class T> inline void prints(V<T>& vec) { if (vec.size() == 0)return; cout << vec[0];	rep(i, 1, vec.size()) { cout << ' ' << vec[i]; } cout << '\n'; }
inline V<int> dtois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - '0'); } return vec; }
inline V<int> atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'a'); } return vec; }
inline V<int> Atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'A'); } return vec; }

inline void chmax(ll& a, ll b) {
	if (a >= b) {
		return;
	}
	a = b;
}

inline void chmin(ll& a, ll b) {
	if (a <= b) {
		return;
	}
	a = b;
}


int main(void) {
	int n;	cin >> n;
	VV<ll> house(n, V<ll>(2));
	rep(i, 0, n) {
		ll x, y;	cin >> x >> y;
		house[i] = { x + y,x - y };
	}

	ll x_max = -inf, y_max = -inf;
	ll x_min = inf, y_min = inf;
	rep(i, 0, n) {
		chmax(x_max, house[i][0]);
		chmax(y_max, house[i][1]);
		chmin(x_min, house[i][0]);
		chmin(y_min, house[i][1]);
	}

	ll a = -inf * 2, b = -inf * 2;
	rep(i, 0, n) {
		ll x = house[i][0], y = house[i][1];
		chmax(a, min(max(x_max - x, y_max - y), max(x - x_min, y - y_min)));
		chmax(b, min(max(x_max - x, y - y_min), max(x - x_min, y_max - y)));
	}
	ll ans = min(a, b) / 2;
	print(ans);

	return 0;
}