#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n;
  cin >> n;
  vector<int> x(n), y(n);
  for (int i = 0; i < n; ++i) cin >> x[i] >> y[i];
  if (n <= 2)
  {
    cout << 0 << endl;
    return 0;
  }
  vector<long long> p(n), q(n);
  for (int i = 0; i < n; ++i)
  {
    p[i] = x[i] + y[i];
    q[i] = x[i] - y[i];
  }
  sort(p.begin(), p.end());
  sort(q.begin(), q.end());
  long long ans = 0, mi = 1e18;
  for (int i = 0; i < n - 1; ++i)
  {
    long long tmp = max(p[i] - p[0], p[n - 1] - p[i + 1]);
    mi = min(mi, tmp);
  }
  ans = mi;
  mi = 1e18;
  for (int i = 0; i < n - 1; ++i)
  {
    long long tmp = max(p[i] - p[0], p[n - 1] - p[i + 1]);
    mi = min(mi, tmp);
  }
  ans = max(ans, mi);
  cout << ans << endl;
}