#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> x(n), y(n);
  REP(i, n) {
    int x_i, y_i; cin >> x_i >> y_i;
    x[i] = (x_i - y_i) / 2;
    y[i] = (x_i + y_i) / 2;
  }
  const int x_min = *min_element(ALL(x)), x_max = *max_element(ALL(x));
  const int y_min = *min_element(ALL(y)), y_max = *max_element(ALL(y));
  ll lb1 = -1, ub1 = 2000000000;
  while (ub1 - lb1 > 1) {
    const ll mid = (lb1 + ub1) / 2;
    bool is_valid = true;
    REP(i, n) {
      is_valid &= (x_min <= x[i] && x[i] <= x_min + mid && y_min <= y[i] && y[i] <= y_min + mid) ||
                  (x_max - mid <= x[i] && x[i] <= x_max && y_max - mid <= y[i] && y[i] <= y_max);
    }
    (is_valid ? ub1 : lb1) = mid;
  }
  ll lb2 = -1, ub2 = 2000000000;
  while (ub2 - lb2 > 1) {
    const ll mid = (lb2 + ub2) / 2;
    bool is_valid = true;
    REP(i, n) {
      is_valid &= (x_min <= x[i] && x[i] <= x_min + mid && y_max - mid <= y[i] && y[i] <= y_max) ||
                  (x_max - mid <= x[i] && x[i] <= x_max && y_min <= y[i] && y[i] <= y_min + mid);
    }
    (is_valid ? ub2 : lb2) = mid;
  }
  cout << min(ub1, ub2) << '\n';
  return 0;
}