#include <bits/stdc++.h>
using namespace std;
int n, x[1000000], y[1000000];
int INF = 1 << 30;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (int)(n); i++) scanf("%d%d", x + i, y + i);
  int minx = INF, maxx = -INF, miny = INF, maxy = -INF;
  int mink = INF, maxk = -INF, minl = INF, maxl = -INF;
  for (int i = 0; i < (int)(n); i++) {
    minx = min(minx, x[i]);
    maxx = max(maxx, x[i]);
    miny = min(miny, y[i]);
    maxy = max(maxy, y[i]);
    mink = min(mink, x[i] + y[i]);
    maxk = max(maxk, x[i] + y[i]);
    minl = min(minl, -x[i] + y[i]);
    maxl = max(maxl, -x[i] + y[i]);
  }
  minx--;
  maxx++;
  miny--;
  maxy++;
  mink--;
  maxk++;
  minl--;
  maxl++;
  int ans = 0;
  ans += (maxl + minx) - (mink - minx);
  ans += (maxy - maxl) - (minx);
  ans += (maxk - maxy) - (maxy - maxl);
  ans += (maxx) - (maxk - maxy);
  ans += (maxk - maxx) - (minl + maxx);
  ans += (maxx) - (miny - minl);
  ans += (miny - minl) - (maxk - miny);
  ans += (maxk - miny) - minx;
  printf("%d\n", ans);
  return 0;
}
