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

int main(void){
  int n; cin >> n;
  vector<ll> x(n), y(n);
  for(int i=0; i<n; i++){
    ll a, b; cin >> a >> b;
    x.push_back(a+b);
    y.push_back(a-b);
  }
  sort(begin(x), end(x));
  sort(begin(y), end(y));
  cout << max(x.back()-x[0], y.back()-y[0])/2 << endl;
  return 0; 
}