#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;

ll f(vector<ll>& x){
  int n=x.size();
  int mid2=n/2, mid1=mid2-1;
  if(n&1) return max(x[mid2]-x[0], x[n-1]-x[mid2]);
  else return max(x[mid1]-x[0], x[n-1]-x[mid2]);
}

int main(void){
  int n; cin >> n;
  vector<ll> x, y;
  for(int i=0; i<n; i++){
    ll a, b; cin >> a >> b;
    x.push_back(a+b);
    y.push_back(a-b);
  }
  // for(auto p:x) cout << p << ' '; cout << endl;
  // for(auto p:y) cout << p << ' '; cout << endl;
  sort(begin(x), end(x));
  sort(begin(y), end(y));
  cout << max(f(x), f(y)) << endl;
  return 0; 
}