#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 10;
const int inf = 1e18;
const double eps = 1e-10;
int n, _, m, k;

class Point
{
public:
    double x, y;
    Point(double x = 0, double y = 0) : x(x), y(y) {}
    Point operator+(Point a)
    {
        return Point(a.x + x, a.y + y);
    }
    Point operator-(Point a)
    {
        return Point(x - a.x, y - a.y);
    }
    bool operator<(const Point &a) const
    {
        if (x == a.x)
            return y < a.y;
        return x < a.x;
    }
};

typedef Point Vector;

double cross(Vector a, Vector b)
{
    return a.x * b.y - a.y * b.x;
}

double dot(Vector a, Vector b)
{
    return a.x * b.x + a.y * b.y;
}

bool isclock(Point p0, Point p1, Point p2)
{
    Vector a = p1 - p0;
    Vector b = p2 - p0;
    if (cross(a, b) < -eps)
        return true;
    return false;
}

double getDistance(Point a, Point b)
{
    return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}

typedef vector<Point> Polygon;
Polygon andrewScan(Polygon s)
{
    Polygon u, l;
    if (s.size() < 3)
        return s;
    sort(s.begin(), s.end());
    u.push_back(s[0]);
    u.push_back(s[1]);
    l.push_back(s[s.size() - 1]);
    l.push_back(s[s.size() - 2]);
    // printf("l[n-2]:%.2f %.2f\nl[n-1]:%.2f %.2f\n", l[l.size() - 2].x, l[l.size() - 2].y, l[l.size() - 1].x, l[l.size() - 1].y);
    for (int i = 2; i < s.size(); i++)
    {
        for (int n = u.size(); n >= 2 && isclock(u[n - 2], u[n - 1], s[i]) != true; n--)
        {
            // cout << u[n - 2].x << ' ' << u[n - 2].y << '\n'
            //      << u[n - 1].x << u[n - 1].y << endl;
            u.pop_back();
        }
        u.push_back(s[i]);
    }
    for (int i = s.size() - 3; i >= 0; i--)
    {
        // cout << i << endl;
        for (int n = l.size(); n >= 2 && isclock(l[n - 2], l[n - 1], s[i]) != true; n--)
        {
            // cout << i << endl;
            // printf("del:\nl[n-2]:%.2f %.2f\nl[n-1]:%.2f %.2f\n", l[n - 2].x, l[n - 2].y, l[n - 1].x, l[n - 1].y);

            l.pop_back();
        }

        l.push_back(s[i]);
    }
    // for (auto &p : u)
    //     printf("%.2f %.2f\n", p.x, p.y);
    // printf("yes\n");
    // for (auto &p : l)
    //     printf("%.2f %.2f\n", p.x, p.y);

    for (int i = 1; i < u.size() - 1; i++)
        l.push_back(u[i]);
    return l;
}
Polygon v, v1;
int dir[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        Point a;
        cin >> a.x >> a.y;
        for (int k = 0; k < 4; k++)
            v.emplace_back(a.x + dir[k][0], a.y + dir[k][1]);
        v1.push_back(a);
    }
    if (n == 1)
    {
        cout << 4 << endl;
        return;
    }
    Polygon b = andrewScan(v);

    int ans = 0;
    Polygon c = andrewScan(v1);
    int dx = c[1].x - c[0].x, dy = c[1].y - c[0].y;
    if (abs(dx) == abs(dy))
    {
        bool flag = true;
        for (int i = 2; i < c.size(); i++)
        {
            if (c[i].x - c[i - 1].x == dx && c[i].y - c[i - 1].y == dy)
                continue;
            else
            {
                flag = false;
                break;
            }
        }
        if (flag)
            ans++;
    }
    b.push_back(b.front());
    for (int i = 1; i < b.size(); i++)
    {
        int x = abs(b[i].x - b[i - 1].x);
        int y = abs(b[i].y - b[i - 1].y);
        ans += max(x, y);
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    _ = 1;
    // cin>>_;
    while (_--)
    {
        solve();
    }
}