#include<cassert>
#include<iostream>
#include<map>
#include<vector>
using namespace std;

typedef long long ll;
typedef vector<ll> vi;

const int INF = 1e7;

int main() {
	int n;
	cin >> n;

	if (n == 1) { cout << "4\n"; return 0; }

	int x = INF, X = -INF, y = INF, Y = -INF;
	int XY = -INF, Xy = -INF, xY = -INF, xy = -INF;

	for (int i=0, u, v; i < n; i++) {
		cin >> u >> v;
		x = min(x, u);
		X = max(X, u);
		y = min(y, v);
		Y = max(Y, v);

		XY = max(XY, +u+v);
		Xy = max(Xy, +u-v);
		xY = max(xY, -u+v);
		xy = max(xy, -u-v);
	}

	// We could have made this simpler:
	int ans = 2*(X+Y-x-y+2);
	ans += XY - (+X+Y);
	ans += Xy - (+X-y);
	ans += xY - (-x+Y);
	ans += xy - (-x-y);
	ans += (XY == -xy || Xy == -xY);
	cout << ans << endl;
	return 0;
}