#include <bits/stdc++.h>
using namespace std;
inline int cmp(double a, double b = 0.0) {
  if (fabs(a - b) <= (1e-9)) return 0;
  if (a < b) return -1;
  return 1;
}
struct point {
  double x, y;
  point(double x = 0, double y = 0) : x(x), y(y) {}
  point operator+(point q) { return point(x + q.x, y + q.y); }
  point operator-(point q) { return point(x - q.x, y - q.y); }
  point operator*(double t) { return point(x * t, y * t); }
  point operator/(double t) { return point(x / t, y / t); }
  double operator*(point q) { return x * q.x + y * q.y; }
  double operator%(point q) { return x * q.y - y * q.x; }
  int cmp(point q) const {
    if (int t = ::cmp(x, q.x)) return t;
    return ::cmp(y, q.y);
  }
  bool operator==(point q) const { return cmp(q) == 0; }
  bool operator!=(point q) const { return cmp(q) != 0; }
  bool operator<(point q) const { return cmp(q) < 0; }
};
double norma(point v) { return v.x * v.x + v.y * v.y; }
int ccw(point a, point b, point c) { return cmp((b - a) % (c - a)); }
point pivo;
bool cmp_radial(point a, point b) {
  int aux = ccw(pivo, a, b);
  return ((aux < 0) || (aux == 0 && norma(a - pivo) < norma(b - pivo)));
}
bool cmp_pivo(point p, point q) {
  int aux = cmp(p.x, q.x);
  return ((aux < 0) || (aux == 0 && cmp(p.y, q.y) < 0));
}
vector<point> graham(vector<point> p) {
  int i, j, n = p.size();
  vector<point> g;
  pivo = *min_element(p.begin(), p.end(), cmp_pivo);
  sort(p.begin(), p.end(), cmp_radial);
  for (i = j = 0; i < n; i++) {
    while (j >= 2 && ccw(g[j - 2], g[j - 1], p[i]) >= 0) {
      g.pop_back();
      j--;
    }
    g.push_back(p[i]);
    j++;
  }
  return g;
}
int main() {
  int n;
  cin >> n;
  int y, x;
  vector<point> p;
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &x, &y);
    p.push_back(point(x, y + 1));
    p.push_back(point(x, y - 1));
    p.push_back(point(x + 1, y));
    p.push_back(point(x - 1, y));
  }
  vector<point> r = graham(p);
  r.push_back(r[0]);
  int res = 0;
  for (int i = 1; i < (int)r.size(); i++) {
    int dx = round(abs(r[i].x - r[i - 1].x));
    int dy = round(abs(r[i].y - r[i - 1].y));
    res += min(dx, dy) + abs(dx - dy);
  }
  cout << res << endl;
  return 0;
}
