#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
    typedef Point P;
    T x, y;
    explicit Point(T x=0, T y=0) : x(x), y(y) {}
    bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
    bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
    P operator+(P p) const { return P(x+p.x, y+p.y); }
    P operator-(P p) const { return P(x-p.x, y-p.y); }
    P operator*(T d) const { return P(x*d, y*d); }
    P operator/(T d) const { return P(x/d, y/d); }
    T dot(P p) const { return x*p.x + y*p.y; }
    T cross(P p) const { return x*p.y - y*p.x; }
    T cross(P a, P b) const { return (a-*this).cross(b-*this); }
    T dist2() const { return x*x + y*y; }
    double dist() const { return sqrt((double)dist2()); }
    // angle to x-axis in interval [-pi, pi]
    double angle() const { return atan2(y, x); }
    P unit() const { return *this/dist(); } // makes dist()=1
    P perp() const { return P(-y, x); } // rotates +90 degrees
    P normal() const { return perp().unit(); }
    // returns point rotated 'a' radians ccw around the origin
    P rotate(double a) const {
        return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
    friend ostream& operator<<(ostream& os, P p) {
        return os << "(" << p.x << "," << p.y << ")"; }
};
typedef Point<ll> P;
vector<P> convexHull(vector<P> pts) {
    if (sz(pts) <= 1) return pts;
    sort(all(pts));
    vector<P> h(sz(pts)+1);
    int s = 0, t = 0;
    for (int it = 2; it--; s = --t, reverse(all(pts)))
        for (P p : pts) {
            while (t >= s + 2 && h[t-2].cross(h[t-1], p) <= 0) t--;
            h[t++] = p;
        }
    return {h.begin(), h.begin() + t - (t == 2 && h[0] == h[1])};
}
int same(vector<P>a){
    sort(a.begin(),a.end());
    set<int>s;
    set<int>t;
    for(auto p: a){
        s.insert(p.x-p.y);
        t.insert(p.x+p.y);
    }
    if(s.size() == 1 || t.size() == 1){
        int v = a.back().x - a[0].x;
        return 2*v+5;
    }
    return 0;
}
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<P>arr(n);
    for(int i = 0; i<n; i++){
        int x,y;
        cin >> x >> y;
        arr[i] = P{x,y};
    }
    if(n==1){
        cout << "4\n";
        return 0;
    }
    int v = same(arr);
    if(v>0){
        cout << v << '\n';
        return 0;
    }
    set<P>s;
    vector<int>dx = {-1,0,1,0};
    vector<int>dy = {0,1,0,-1};
    for(int i = 0; i<n; i++){
        for(int d = 0; d<4; d++){
            P p = arr[i] + P{dx[d],dy[d]};
            s.insert(p);
        }
    }
    vector<P>vec;
    for(auto nxt: s){
        vec.push_back(nxt);
    }
    vector<P>a = convexHull(vec);
    int ans = a.size();

    a.push_back(a[0]);
    for(int i = 1; i<a.size(); i++){
        int v = max(abs(a[i-1].x-a[i].x),abs(a[i].y-a[i-1].y))-1;
        ans+=v;
    }
    cout << ans << '\n';
    return 0;
}