/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <iostream>
#include <fstream>

#include <iostream>
#include "bits/stdc++.h"

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int                     integer;
#define int                     long long
typedef pair<int, int>          pii;
#define vii                     vector<pair<int,int>>
#define vi                      vector<int>
#define vvi                     vector<vector<int>>
#define rep(i, a, b)            for(int i = a; i < (b); i++)
#define s(x)                    in>>x
#define s2(x,y)                 in>>x>>y
#define s3(x,y,z)               in>>x>>y>>z
#define s4(x,y,z,w)             in>>x>>y>>z>>w
#define p(x)                    out<<(x)<<endl
#define p2(x,y)                 out<<(x)<<' '<<(y)<<endl
#define p3(x,y,z)               out<<(x)<<' '<<(y)<<' '<<(z)<<endl
#define p4(x,y,z,w)             out<<(x)<<' '<<(y)<<' '<<(z)<<' '<<(w)<<endl
#define p1d(a,n)                for(int ix=0;ix<n;ix++) out<<a[ix]<<(ix == n-1? '':' '); out<<endl
#define p2d(a,n,m)              for(int ix=0;ix<n;ix++){ for(int jx=0;jx<m;jx++) out<<a[ix][jx]<<" "; out<<endl;}
#define pl(x)                   out<<(x)
#define pll(x)                  out<<(x)<<' '
#define range(v)                v.begin(),v.end()
#define all(x)                  begin(x), end(x)
#define sz(x)                   (int)(x).size()
#define rst(x)                  memset(x, -1, sizeof(x))
#define UNVISITED               -1
#define VISITED                 0
#define EXPLORED                2

#define EACH(x, a) for (auto& x: a)
template<class T> void read_v(T& x, std::istream& in) {
    in >> (x);
}
template<class A> void read_vec(vector<A>& x, std::istream& in) {
    EACH(a, x)
        read_v(a, in);
}

bool sortpairbysec(const pair<int,int> &a,const pair<int,int> &b){return (a.second < b.second);}
template <typename T>
T factmod(T a, T modulus){ int res = 1, i; for (i = 2; i <= a; i++){ res *= i; res%=modulus;} return res; }
template <typename T>
int powmod(T a,T b,int m){ int ans=1; while(b>0){if(b&1){ans*=a;ans%=m;}a*=a;a%=m;b>>=1;} return ans; }
template <typename T>
int power(T a, T b){ int ans=1; while(b>0){if(b&1){ans*=a;}a*=a;b>>=1;}return ans;}

struct ps{
    int x;
    int y;
    int modvalue;
};
typedef struct ps pss;

void compare_point(pss& point, int value, int a, int b){
    if(value > point.modvalue){
        point.modvalue = value;
        point.x = a;
        point.y = b;
    }
    return;
}

void ssolve(std::istream& in, std::ostream& out){
    int n; s(n);
    pss po1 = {0, 0, LONG_LONG_MIN};
    pss po2 = {0, 0, LONG_LONG_MIN};
    pss po3 = {0, 0, LONG_LONG_MIN};
    pss po4 = {0, 0, LONG_LONG_MIN};
    vii points(n);
    rep(i, 0, n){
        int a, b; s2(a, b); points[i] = make_pair(a, b);
        int t1 = a + b;
        int t2 = a - b;
        int t3 = -a + b;
        int t4 = -a - b;
        compare_point(po1, t1, a, b);
        compare_point(po2, t2, a, b);
        compare_point(po3, t3, a, b);
        compare_point(po4, t4, a, b);
    }
    int ans = 0;
    rep(i, 0, n){
        ans = max(ans, abs(po1.x - points[i].first) + abs(po1.y - points[i].second));
        ans = max(ans, abs(po2.x - points[i].first) + abs(po2.y - points[i].second));
        ans = max(ans, abs(po3.x - points[i].first) + abs(po3.y - points[i].second));
        ans = max(ans, abs(po4.x - points[i].first) + abs(po4.y - points[i].second));
    }
    p(ans);
    return;
}

class EDistMax {
public:
void solve(std::istream& in, std::ostream& out) {
    ios_base::sync_with_stdio(false);
    in.tie(nullptr);out.tie(nullptr);
    int t;
    int READ = 0;
    if(READ) s(t);
    else t = 1;
    while(t--){
        ssolve(in, out);
    }
}
};

integer main() {
    EDistMax solver;
    std::istream& in(std::cin);
     std::ostream& out(std::cout);
     solver.solve(in, out);
}

Measured memory_bytes: 6344