#include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;

#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r + 1)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using ll = long long;
using ld = long double;

const ll INF = 2e18;
// const int INF = 2e9;

template <class T> using vc = vector<T>;
template <class T> using vv = vector<vector<T>>;
template <class T> using vvv = vector<vector<vector<T>>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pq_g = priority_queue<T, vc<T>, greater<T>>;

template <class T> istream &operator>>(istream &i, vc<T> &v) {
    rep(j, 0, (int)v.size()) i >> v[j];
    return i;
}
template <class T> ostream &operator<<(ostream &o, vc<T> &v) {
    rep(j, 0, (int)v.size()) o << v[j] << " ";
    return o;
}

template <class T> bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

constexpr double EPS = 1e-9;
inline bool eq(double a, double b) { return fabs(a - b) < EPS; }
inline bool lt(double a, double b) { return a < b - EPS; }
inline bool gt(double a, double b) { return a > b + EPS; }
inline int sgn(double x) {
    if (x > EPS) return 1;
    if (x < -EPS) return -1;
    return 0;
}
#define div(x, y) (double)(((double)x+EPS) / y)
#define divl(x, y) (long double)(((long double)x+EPS) / y)

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    int N;cin>>N;
    vc<ll>X(N),Y(N);rep(i,0,N)cin>>X[i]>>Y[i];
    pair<ll,int>umax={-INF,-1},umin={INF,-1},vmax={-INF,-1},vmin={INF,-1};
    rep(i,0,N){
        chmax(umax,{X[i]+Y[i],i});
        chmin(umin,{X[i]+Y[i],i});
        chmax(vmax,{X[i]-Y[i],i});
        chmin(vmin,{X[i]-Y[i],i});
    }
    int u,v;
    if(umax.first-umin.first>vmax.first-vmin.first)u=umax.second,v=umin.second;
    else u=vmax.second,v=vmin.second;

    vc<int>us,vs;
    rep(i,0,N){
        if(abs(X[u]-X[i])+abs(Y[u]-Y[i])<abs(X[v]-X[i])+abs(Y[v]-Y[i]))us.push_back(i);
        else vs.push_back(i);
    }

    auto f=[&](vc<int>ps){
        ll r=-INF,l=INF,u=-INF,d=INF;
        for(int v:ps){
            chmax(r,X[v]);
            chmin(l,X[v]);
            chmax(u,Y[v]);
            chmin(d,Y[v]);
        }
        return max(r-l,u-d);
    };
    cout<<max(f(us),f(vs))<<endl;

    return 0;
}