#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<cmath>
#include<map>
#include<functional>
#include<queue>
#include<set>
#include<stack>
#include<iomanip>
#include<algorithm>
#include<unordered_map>
#include <numeric>
#include<string_view>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(i) i.begin(),i.end()
template<typename T =ll> using v = vector<T>;
template<typename T =ll> using vv = v<v<T>>;
template<typename T =ll,typename U =ll> using p = pair<T,U>;
template<typename T> T chmin(T &a,T b) {return a=min(a,b);}
template<typename T> T chmax(T &a,T b) {return a=max(a,b);}
const ll INF = (ll)1e18;
template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 1e9 + 7;
using mint = ModInt<MOD>;

void a(){
  ll x; cin >> x;
  cout << (x?0:1) << endl; 
}

void b(){
    ll A,B,C,D; cin >> A >> B >> C >> D;
    ll K[4]={A*C,A*D,C*B,B*D};
    ll ans = -INF;
    rep(i,4) chmax(ans,K[i]);
    cout << ans << endl;
}

mint powm(mint i, ll j){
    v<mint> k;
    while(j!=1){
        if(j%2){
            k.push_back(i);
        }
        i*=i;
        j/=2;
    }

    for(auto s:k){
        i*=s;
    }
    return i;
}

void c(){
    ll N; cin >> N;
    mint ANS = powm(10,N)-powm(9,N)-powm(9,N)+powm(8,N);
    cout << ANS << endl; 
}

void d(){
    ll S; cin >> S;
    auto dp = v<mint>(S+1,0);
    dp[0]=1;
    for(ll i=0;i<S+1;i++){
        for(ll j=0;j<=i-3;j++){
            dp[i]+=dp[j];
        }
    }
    cout << dp[S] << endl;
}

void e(){
   ll N; cin >> N;
   auto x_plus_y = v<>();
   auto x_minus_y = v<>();
   
   rep(i,N){
       ll x,y;
       cin >> x >> y;
       x_plus_y.push_back(x+y);
       x_minus_y.push_back(x-y);
   }
   sort(all(x_plus_y));
   sort(all(x_minus_y));
   
   cout << max(x_plus_y[N-1]-x_plus_y[0],x_minus_y[N-1]-x_minus_y[0]);

}

void f(){
    
}

int main(void){
    e();
    return 0;
 }


Measured memory_bytes: 6656