#include <bits/stdc++.h>
using namespace std;
int Max(int a, int b) { return a > b ? a : b; }
int Min(int a, int b) { return a < b ? a : b; }
struct node {
  int x, y;
};
node mm[100005];
int main() {
  int n;
  int ans, i;
  int left, right, top, bottom;
  node topleft, topright, bottomleft, bottomright;
  node po[10];
  topleft.x = 10000007;
  topleft.y = -10000007;
  topright.x = -10000007;
  topright.y = -10000007;
  bottomleft.x = 100000007;
  bottomleft.y = 100000007;
  bottomright.x = -10000007;
  bottomright.y = 100000007;
  left = 10000007;
  top = -10000007;
  bottom = 100000007;
  right = -10000007;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d%d", &mm[i].x, &mm[i].y);
    left = Min(mm[i].x, left);
    right = Max(right, mm[i].x);
    top = Max(top, mm[i].y);
    bottom = Min(bottom, mm[i].y);
    if (topleft.y - topleft.x < mm[i].y - mm[i].x) {
      topleft.x = mm[i].x;
      topleft.y = mm[i].y;
    }
    if (bottomright.y - bottomright.x > mm[i].y - mm[i].x) {
      bottomright.x = mm[i].x;
      bottomright.y = mm[i].y;
    }
    if (bottomleft.x + bottomleft.y > mm[i].x + mm[i].y) {
      bottomleft.x = mm[i].x;
      bottomleft.y = mm[i].y;
    }
    if (topright.x + topright.y < mm[i].x + mm[i].y) {
      topright.x = mm[i].x;
      topright.y = mm[i].y;
    }
  }
  left--;
  right++;
  top++;
  bottom--;
  topleft.y++;
  topright.y++;
  bottomleft.y--;
  bottomright.y--;
  po[0].x = top - topleft.y + topleft.x;
  po[0].y = top;
  po[1].x = left;
  po[1].y = po[1].x + topleft.y - topleft.x;
  po[2].x = left;
  po[2].y = bottomleft.x + bottomleft.y - left;
  po[3].y = bottom;
  po[3].x = bottomleft.x + bottomleft.y - po[3].y;
  po[4].y = bottom;
  po[4].x = po[4].y - bottomright.y + bottomright.x;
  po[5].x = right;
  po[5].y = po[5].x + bottomright.y - bottomright.x;
  po[6].x = right;
  po[6].y = topright.x + topright.y - po[6].x;
  po[7].y = top;
  po[7].x = topright.x + topright.y - po[7].y;
  ans = 0;
  for (i = 0; i < 7; i++) {
    ans += abs(po[i].x - po[i + 1].x) + abs(po[i].y - po[i + 1].y);
    if (abs(po[i].x - po[i + 1].x) == abs(po[i].y - po[i + 1].y))
      ans -= abs(po[i].x - po[i + 1].x);
  }
  ans += abs(po[7].x - po[0].x) + abs(po[7].y - po[0].y);
  printf("%d\n", ans);
  return 0;
}
