#include <bits/stdc++.h>
using namespace std;
long long sq(long long x) { return x * x; }
long long Abs(long long x) { return x < 0 ? -x : x; }
struct P {
  long long x, y;
  P() {}
  P(long long x, long long y) : x(x), y(y) {}
  P operator+(const P &p) const { return P(x + p.x, y + p.y); }
  P operator-(const P &p) const { return P(x - p.x, y - p.y); }
  P operator*(long long k) { return P(x * k, y * k); }
  long long operator*(P p) { return x * p.x + y * p.y; }
  long long operator^(P p) { return x * p.y - y * p.x; }
  bool operator<(const P &p) const {
    if (x == p.x) return y < p.y;
    return x < p.x;
  }
  bool operator==(const P &p) const { return x == p.x && y == p.y; }
  long long dist(P p) {
    long long dx = Abs(x - p.x), dy = Abs(y - p.y);
    return max(dx, dy);
  }
};
long long Area(P a, P b, P c) { return (b - a) ^ (c - a); }
bool Ccw(P a, P b, P c) { return Area(a, b, c) > 0; }
void MonoHull(P *p, int np, P *h, int &nh) {
  sort(p, p + np);
  np = unique(p, p + np) - p;
  nh = 0;
  for (int i = 0; i < np; i++) {
    while (nh >= 2 && !Ccw(h[nh - 2], h[nh - 1], p[i])) --nh;
    h[nh++] = p[i];
  }
  int k = nh;
  for (int i = np - 2; i >= 0; i--) {
    while (nh > k && !Ccw(h[nh - 2], h[nh - 1], p[i])) --nh;
    h[nh++] = p[i];
  }
  if (nh == 1) h[nh] = h[0];
  if (nh > 1) --nh;
}
const int N = 600000;
P p[N], h[N];
int np = 0, nh, n;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int main() {
  scanf("%d", &n);
  long long x, y;
  while (n--) {
    scanf("%I64d%I64d", &x, &y);
    for (int k = 0; k < 4; k++) p[np++] = P(x + dx[k], y + dy[k]);
  }
  MonoHull(p, np, h, nh);
  long long ans = 0;
  for (int i = 0; i < nh; i++) {
    ans += h[i].dist(h[(i + 1) % nh]);
  }
  printf("%I64d\n", ans);
}
