text: #include <bits/stdc++.h>
  // #include <atcoder/all>
  // using namespace atcoder;
  typedef long long ll;
  typedef long double ld;
  #define rep(i,n) for(ll i=0;i<(n);i++)
  #define repr(i,n) for(ll i=(n-1);i>=0;i--)
  #define all(x) x.begin(),x.end()
  #define br cout << "\n";
  using namespace std;
  const long long INF = 1e18;
  const long long MOD = 1e9+7;
  using Graph = vector<vector<ll>>;
  template<class T> inline bool chmin(T &a, T b) { if(a > b){ a = b; return true;} return false;}
  template<class T> inline bool chmax(T &a, T b) { if(a < b){ a = b; return true;} return false;}
  ll ceilll(ll a, ll b) {return (a + b-1) / b;} // if(a%b != 0) (a/b) + 1
  ll get_digit(ll a) {ll digit = 0; while(a != 0){a /= 10; digit++;} return digit;} // a != 0
  template<typename T> void vecdbg(vector<T>& v){ rep(i, v.size()){cerr << v[i] << " ";} br;}
  template<typename T> void vecvecdbg(vector<vector<T>>& v){ rep(i, v.size()){rep(j, v[i].size()){cerr << v[i][j] << " ";} br;}}
  ll POW(ll a, ll n){ ll res = 1; while(n > 0){ if(n & 1){ res = res * a; } a *= a; n >>= 1; } return res; }
  using P = pair<ll, ll>;
  
  // 0 false, 1 true 
  // string number to int : -48 or - '0'
  // a to A : -32
  // ceil(a)  1.2->2.0
  // c++17	g++ -std=c++17 a.cpp
  // global vector -> 0 initialization
  // DONT FORGET TO INTIALIZE
  // The type of GRID is CHAR. DONT USE STRING
  // If the result in local and judge is different, USE CODETEST!!
  // (a * b)over flow?   if(a > INF / b){ /* overflow */}
  
  int main() {
      std::cout << std::fixed << std::setprecision(15);
      ll n; cin >> n;
      vector<P> x(n);
      vector<P> y(n);
      rep(i, n){
          ll xx, yy; cin >> xx >> yy;
          x[i] = {xx, i}; y[i] = {yy, i};
      }
  
      sort(all(x));
      sort(all(y));
  
      if(x[n-1].second == y[n-1].second){
          //同じ (x[n-1], y[n-1])が1番目確定
          ll first_node = x[n-1].second;
  
          //2番目
          ll tmpx = abs(x[n-2].first - x[0].first), tmpy = abs(y[n-2].first - y[0].first);
          ll tmp2x = abs(x[n-1].first - x[1].first), tmp2y = abs(y[n-1].first - y[1].first);
          ll ans = max(tmpx, tmpy);
          ans = max(ans, tmp2x); ans = max(ans, tmp2y);
          cout << ans << endl;
      }else{
          //1番目
          ll fx = abs(x[n-1].first - x[0].first), fy = abs(y[n-1].first - y[0].first);
          //1番目の残骸
          ll notfirst = min(fx, fy);
  
          //2番目
          ll tmpx = abs(x[n-2].first - x[0].first), tmpy = abs(y[n-2].first - y[0].first);
          ll tmp2x = abs(x[n-1].first - x[1].first), tmp2y = abs(y[n-1].first - y[1].first);
          ll ans = max(notfirst, tmpx);
          ans = max(ans, tmpy); ans = max(ans, tmp2x); ans = max(ans, tmp2y);
          cout << ans << endl;
  
      }
  
  }