/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
 #define DEBUG(...)
#endif
/*}}}*/
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
const int SIZE = 1<<20;
int N;
int x[SIZE], y[SIZE];
int cmpx(int v1, int v2){
    return x[v1]<x[v2];
}
int cmpy(int v1, int v2){
    return y[v1]<y[v2];
}
void solve() {
    VI d(N);
    REP(i,N)d[i]=i;
    sort(ALL(d),cmpx);
    VPII pp;
    REP(i,2){
        REPP(j,N-2,N){
            int x=d[i];
            int y=d[j];
            if(x>y)swap(x,y);
            if(x!=y)pp.PB(MP(x,y));
        }
    }
    sort(ALL(d),cmpy);
    REP(i,2){
        REPP(j,N-2,N){
            int x=d[i];
            int y=d[j];
            if(x>y)swap(x,y);
            if(x!=y)pp.PB(MP(x,y));
        }
    }
    SORT_UNIQUE(pp);
    VI an;
    REP(i,SZ(pp)){
        an.PB(max(abs(x[pp[i].F]-x[pp[i].S]),abs(y[pp[i].F]-y[pp[i].S])));
    }
    sort(ALL(an));
    W(an[SZ(an)-2]);
}
void input() {
    R(N);
    REP(i,N){
        R(x[i],y[i]);
    }
}
int main(){
    input();
    solve();
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef pair<long long, int> P;
int main(){
    int N;
    cin >> N;
    vector<P> X(N), Y(N);
    for(int i =0 ; i < N; i++) {
        long long x, y;
        cin >> x >> y;
        X[i] = {x, i};
        Y[i] = {y, i};
    }
    sort(X.begin(), X.end());
    sort(Y.begin(), Y.end());
    set<pair<int, int>> s;
    long long t = X[N - 1].first - X[0].first;
    vector<long long> temp;
    temp.push_back(t);
    s.insert({X[N - 1].second, X[0].second});
    s.insert({X[0].second, X[N - 1].second});
    long long te = Y[N - 1].first - Y[0].first;
    if(!s.count({Y[N - 1].second, Y[0].second})){
        s.insert({Y[N - 1].second, Y[0].second});
        s.insert({Y[0].second, Y[N - 1].second});
        temp.push_back(te);
    }
    t = X[N - 2].first - X[0].first;
    if(!s.count({X[N - 2].second, X[0].second})){
        s.insert({X[N - 2].second, X[0].second});
        s.insert({X[0].second, X[N - 2].second});
        temp.push_back(t);
    }
    t = X[N - 1].first - X[1].first;
    if(!s.count({X[N - 1].second, X[1].second})){
        s.insert({X[N - 1].second, X[1].second});
        s.insert({X[1].second, X[N - 2].second});
        temp.push_back(t);
    }
    t = Y[N - 2].first - Y[0].first;
    if(!s.count({Y[N - 2].second, Y[0].second})){
        s.insert({Y[N - 2].second, Y[0].second});
        s.insert({Y[0].second, Y[N - 2].second});
        temp.push_back(t);
    }
    t = Y[N - 1].first - Y[1].first;
    if(!s.count({Y[N - 1].second, Y[1].second})){
        s.insert({Y[N - 1].second, Y[1].second});
        s.insert({Y[1].second, Y[N - 1].second});
        temp.push_back(t);
    }
    sort(temp.begin(), temp.end());
    int sz = temp.size();
    cout << temp[sz - 2] << endl;
}
