#include <bits/stdc++.h>
using namespace std;
double const pi = 3.1415926535897932384626433832795;
long long const inf64 = (long long)2e18;
int const NMAX = 100010;
int n, x[NMAX], y[NMAX];
pair<int, int> q[NMAX];
int const inf = (int)1e8;
int get(int x1, int qqqqqqq, int x2, int y2) {
  return abs(x1 - x2) + abs(qqqqqqq - y2) - 1;
}
int calc(int xx, int yy) {
  int res = inf;
  for (int i = 0; i < (int)n; i++) res = min(res, get(xx, yy, x[i], y[i]));
  return res;
}
int main() {
  cin >> n;
  for (int i = 0; i < (int)n; i++) scanf("%d%d", &q[i].first, &q[i].second);
  sort(q, q + n);
  for (int i = 0; i < (int)n; i++) x[i] = q[i].first, y[i] = q[i].second;
  int xmax = -inf;
  int ymax = -inf;
  int xmin = inf;
  int ymin = inf;
  for (int i = 0; i < (int)n; i++) {
    xmin = min(xmin, x[i] - 1);
    ymin = min(ymin, y[i] - 1);
    xmax = max(xmax, x[i] + 1);
    ymax = max(ymax, y[i] + 1);
  }
  int ans = 2 * (ymax - ymin) + 2 * (xmax - xmin);
  ans -= calc(xmin, ymin);
  ans -= calc(xmin, ymax);
  ans -= calc(xmax, ymax);
  ans -= calc(xmax, ymin);
  cout << ans << endl;
  return 0;
}
