#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

static constexpr ll inf = 4000000000;

int main() {
  int n;
  cin >> n;
  vector<ll> x(n), y(n);
  rep(i,0,n) {
    int a, b;
    cin >> a >> b;
    x[i] = a+b, y[i] = a-b;
  }
  if (n <= 2) {
    cout << 0 << endl;
    return 0;
  }
  ll mx = *min_element(all(x));
  function<bool(ll)> f = [&](ll d) {
    vector<int> v, w;
    ll y0 = inf, y1 = -inf, y2 = inf, y3 = -inf;
    rep(i,0,n) {
      if (x[i] <= mx+d) {
        y0 = min(y0, y[i]), y1 = max(y1, y[i]);
        v.eb(i);
      } else {
        y2 = min(y2, y[i]), y3 = max(y3, y[i]);
        w.eb(i);
      }
    }
    if (y1-y0 <= d) {
      ll x2 = inf, x3 = -inf;
      for (int i : w) {
        x2 = min(x2, x[i]), x3 = max(x3, x[i]);
      }
      if (x3-x2 <= d && y3-y2 <= d) {
        return 1;
      }
      return 0;
    }
    ll x4 = inf, x5 = -inf, y4 = y2, y5 = y3;
    for (int i : v) if (y[i]-y0 > d) {
      x4 = min(x4, x[i]), x5 = max(x5, x[i]);
      y4 = min(y4, y[i]), y5 = max(y5, y[i]);
    }
    for (int i : w) {
      x4 = min(x4, x[i]), x5 = max(x5, x[i]);
      y4 = min(y4, y[i]), y5 = max(y5, y[i]);
    }
    if (x5-x4 <= d && y5-y4 <= d) {
      return 1;
    }
    x4 = inf, x5 = -inf, y4 = y2, y5 = y3;
    for (int i : v) if (y1-y[i] > d) {
      x4 = min(x4, x[i]), x5 = max(x5, x[i]);
      y4 = min(y4, y[i]), y5 = max(y5, y[i]);
    }
    for (int i : w) {
      x4 = min(x4, x[i]), x5 = max(x5, x[i]);
      y4 = min(y4, y[i]), y5 = max(y5, y[i]);
    }
    if (x5-x4 <= d && y5-y4 <= d) {
      return 1;
    }
    return 0;
  };
  ll ng = 0, ok = 4000000000;
  while(ok-ng > 1) {
    ll mid = (ok+ng)/2;
    if (f(mid)) ok = mid;
    else ng = mid;
  }
  cout << ok << endl;
  return 0;
}