// Arup Guha
// 6/11/2025
// Solution to Kattis Problem: Building Fences
// https://open.kattis.com/problems/buildinfences

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

int main() {

    // Read first point set min and max.
    int n;
    cin >> n;
    int minx, maxx, miny, maxy;
    cin >> minx >> miny;
    maxx = minx;
    maxy = miny;

    // Process the rest of the points.
    for (int loop=0; loop<n-1; loop++) {

        // Get next point.
        int x, y;
        cin >> x >> y;

        // Update mins and maxes.
        minx = min(minx, x);
        maxx = max(maxx, x);
        miny = min(miny, y);
        maxy = max(maxy, y);
    }

    cout << 2*(maxx - minx + 2) + 2*(maxy - miny + 2) << endl;

    return 0;
}