#include <bits/stdc++.h>
using namespace std;
const long long INF = 10000000000;
int main(){
  int N;
  cin >> N;
  vector<int> X(N), Y(N);
  for (int i = 0; i < N; i++){
    cin >> X[i] >> Y[i];
  }
  vector<long long> S(N), D(N);
  for (int i = 0; i < N; i++){
    S[i] = X[i] + Y[i];
    D[i] = X[i] - Y[i];
  }
  long long mxS = -INF, mnS = INF, mxD = -INF, mnD = INF;
  for (int i = 0; i < N; i++){
    mxS = max(mxS, S[i]);
    mnS = min(mnS, S[i]);
    mxD = max(mxD, D[i]);
    mnD = min(mnD, D[i]);
  }
  long long tv = INF, fv = -1;
  while (tv - fv > 1){
    long long mid = (tv + fv) / 2;
    bool ok;
    if (mxS - mnS <= mid * 2 && mxD - mnD <= mid * 2){
      ok = true;
    } else if (mxS - mnS > mid * 2 && mxD - mnD > mid * 2){
      bool ok1 = true, ok2 = true;
      for (int i = 0; i < N; i++){
        long long d1 = max(abs(S[i] - (mnS + mid)), abs(D[i] - (mnD + mid)));
        long long d2 = max(abs(S[i] - (mnS + mid)), abs(D[i] - (mxD - mid)));
        long long d3 = max(abs(S[i] - (mxS - mid)), abs(D[i] - (mnD + mid)));
        long long d4 = max(abs(S[i] - (mxS - mid)), abs(D[i] - (mxD - mid)));
        if (d1 > mid && d4 > mid){
          ok1 = false;
        }
        if (d2 > mid && d3 > mid){
          ok2 = false;
        }
      }
      ok = ok1 || ok2;
    } else {
      bool ok1 = true, ok2 = true;
      for (int i = 0; i < N; i++){
        if (mnS + mid * 2 < S[i] && S[i] < mxS - mid * 2){
          ok1 = false;
        }
        if (mnD + mid * 2 < D[i] && D[i] < mxD - mid * 2){
          ok2 = false;
        }
      }
      ok = ok1 && ok2;
    }
    if (ok){
      tv = mid;
    } else {
      fv = mid;
    }
  }
  cout << tv << endl;
}