/*!enjoy karo yaar!*/

//CF,CC,AtC,SPOJ: hp1999
//HE: hemant269
//HR: hemant2132

#include<bits/stdc++.h>
using namespace std;

/*-----<Defines>-----*/
#define     int             long long int
#define     fast()          ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define     all(x)          begin(x),end(x)
#define     rz(x)           resize(x)
#define     asn(x,y)        assign(x,y)
#define     mem(a,b)        memset(a,b,sizeof(a))
#define     sz(x)           ((int)size(x))
#define     eb              emplace_back
#define     pb              push_back
#define     pf              push_front
#define     pob             pop_back
#define     pof             pop_front
#define     ins             insert
#define     vi              vector<int>
#define     pii             pair<int,int>
#define     mii             map<int,int>
#define     F               first
#define     S               second
#define     remax(a,b)      a=max(a,b)
#define     remin(a,b)      a=min(a,b)
#define     bitcount(x)     __builtin_popcountll(x)
#define     iceil(n,x)      (((n)-1)/(x)+1)
#define     flush           fflush(stdout)

using ull=unsigned long long;
using ll=long long;
using ld=long double;
/*-----</Defines>-----*/

/*-----<Debugging Stuff>-----*/
string to_string(char s)
{   string res="'''";res[1]=s;return res; }

string to_string(string s)
{   return '"'+s+'"'; }

string to_string(const char* s)
{   return to_string((string)s); }

string to_string(bool b)
{   return (b?"true":"false"); }

template<typename A, typename B>
string to_string(pair<A, B> p)
{   return "("+to_string(p.F)+", "+to_string(p.S)+")"; }

template<typename A>
string to_string(A v)
{
    bool first=1; string res="{";
    for(const auto &x:v)
    {
        if(!first)  res+=", ";
        first=0;
        res+=to_string(x);
    }
    res+="}";
    return res;
}

void debug() { cout<<"\n"; }
template<typename Head, typename... Tail>
void debug(Head H, Tail... T)
{
    cout<<" "<<to_string(H);
    debug(T...);
}

#define show(...) cout << "[" << #__VA_ARGS__ << "]:", debug(__VA_ARGS__)
/*-----</Debugging Stuff>-----*/

/*-----<Mod Operations>-----*/
const int M=1e9+7;
inline int add(int a,int b,int p=M){ a=a+b; if(a>=p) a-=p; return a; }
inline int sub(int a,int b,int p=M){ a=a-b; if(a<0) a+=p; return a; }
inline int mul(int a,int b,int p=M){ a=(a*1ll*b)%p; return a; }
/*-----</Mod Operations>-----*/

/*-----<Constants>-----*/
const ld pi=acos(-1),eps=1e-9;
const ll inf=1e18;
const int N=2e5+5;
/*-----</Constants>-----*/

vi tree(4*N,inf);

int mrg(int a,int b)
{
    int c=min(a,b);
    return c;
}

// for point update and range query:
void point_update(int node,int beg,int en,int idx,int val)
{
    if(beg==en)
    {
        //base[idx]=val;
        remin(tree[node],val);
        return;
    }

    int mid=(beg+en)/2;
    if(beg<=idx && idx<=mid)
        point_update(2*node,beg,mid,idx,val);
    else
        point_update(2*node+1,mid+1,en,idx,val);

    tree[node]=mrg(tree[2*node],tree[2*node+1]);
}

int range_query(int node,int beg,int en,int l,int r)
{
    if(r<beg || en<l)
        return inf;

    if(l<=beg && en<=r)
        return tree[node];

    int mid=(beg+en)/2;
    int q1=range_query(2*node,beg,mid,l,r);
    int q2=range_query(2*node+1,mid+1,en,l,r);

    return mrg(q1,q2);
}

void solve()
{
    int n;
    cin>>n;

    mii mp;

    vector<pii> v(n);
    for(auto& [a,b]:v)
    {
        cin>>a>>b;
    }

    int ans=0;
    int cnt;

    auto func=[&]()
    {
        mp.clear();
        for(auto& c:v)
            mp[c.S];

        cnt=1;
        for(auto& c:mp)
            c.S=cnt++;

        sort(all(v));

        fill(all(tree),inf);

        for(int i=0;i<n;++i)
        {
            auto [a,b]=v[i];

            ans=max(ans,a+b-range_query(1,1,cnt,1,mp[b]));

            point_update(1,1,cnt,mp[b],a+b);
        }

        fill(all(tree),inf);

        for(int i=0;i<n;++i)
        {
            auto [a,b]=v[i];

            ans=max(ans,a-b-range_query(1,1,cnt,mp[b],cnt));

            point_update(1,1,cnt,mp[b],a-b);
        }
    };

    func();

//    show(ans);

    for(auto& c:v)
        swap(c.F,c.S);

    func();

    cout<<ans;
}

int32_t main()
{
    fast();

    int t=1;
    //cin>>t;
    for(int z=1;z<=t;++z)
    {
        solve();
        //cout<<"\n";
    }

    return 0;
}




Measured memory_bytes: 25112