#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
} p[8];
int a0, a1, b0, b1, x1, x0, yy1, yy0;
int minn(int x, int y) { return x < y ? x : y; }
int maxx(int x, int y) { return x > y ? x : y; }
int main() {
  int i, j, k, n, x, y, ans;
  b0 = a0 = x0 = yy0 = 100000000;
  x1 = yy1 = a1 = b1 = -100000000;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d%d", &x, &y);
    x1 = maxx(x1, x);
    yy1 = maxx(yy1, y);
    a1 = maxx(a1, y - x);
    b1 = maxx(b1, y + x);
    x0 = minn(x0, x);
    yy0 = minn(yy0, y);
    a0 = minn(a0, y - x);
    b0 = minn(b0, y + x);
  }
  x1++;
  yy1++;
  a1++;
  b1++;
  x0--;
  yy0--;
  a0--;
  b0--;
  p[0].y = yy1;
  p[0].x = yy1 - a1;
  p[1].y = yy1;
  p[1].x = b1 - yy1;
  p[2].x = x1;
  p[3].x = x1;
  p[2].y = b1 - x1;
  p[3].y = a0 + x1;
  p[4].y = yy0;
  p[5].y = yy0;
  p[4].x = yy0 - a0;
  p[5].x = b0 - yy0;
  p[6].x = p[7].x = x0;
  p[6].y = b0 - x0;
  p[7].y = a1 + x0;
  ans = 0;
  ans += p[1].x - p[0].x + p[2].y - p[3].y + p[4].x - p[5].x + p[7].y - p[6].y;
  ans += p[2].x - p[1].x + p[3].x - p[4].x + p[5].x - p[6].x + p[0].x - p[7].x;
  printf("%d\n", ans);
  return 0;
}
