#include <bits/stdc++.h>
using namespace std;
struct P {
  long long x, y;
  P(long long x = 0, long long y = 0) : x(x), y(y) {}
  long long SSize() { return x * x + y * y; }
};
bool operator<(P a, P b) {
  if (a.y != b.y) return a.y < b.y;
  return a.x < b.x;
}
bool operator==(P a, P b) { return a.y == b.y && a.x == b.x; }
P operator-(P a, P b) { return P(a.x - b.x, a.y - b.y); }
P operator+(P a, P b) { return P(a.x + b.x, a.y + b.y); }
long long operator^(P a, P b) { return a.x * b.y - a.y * b.x; }
long long operator*(P a, P b) { return a.x * b.x + a.y * b.y; }
P v(1, 0);
bool CMP(P a, P b) {
  if ((a ^ b) != 0) return (a ^ b) > 0;
  return (a.SSize() < b.SSize());
}
long long Abs(long long x) {
  if (x < 0) return -x;
  return x;
}
long long Max(long long a, long long b) {
  if (a < b) return b;
  return a;
}
long long Dist(P a, P b) { return Max(Abs(a.x - b.x), Abs(a.y - b.y)); }
int main() {
  int n;
  cin >> n;
  vector<P> a;
  int x, y;
  for (int i = 0; i < n; i++) {
    cin >> x >> y;
    a.push_back(P(x + 1, y));
    a.push_back(P(x, y + 1));
    a.push_back(P(x - 1, y));
    a.push_back(P(x, y - 1));
  }
  sort(a.begin(), a.end());
  vector<P> ta;
  ta.push_back(a[0]);
  for (int i = 1; i < a.size(); i++)
    if (!(a[i] == a[i - 1])) ta.push_back(a[i]);
  a = ta;
  unique(a.begin(), a.end());
  n = a.size();
  for (int i = 1; i < n; i++) {
    a[i].x -= a[0].x;
    a[i].y -= a[0].y;
  }
  sort(a.begin() + 1, a.end(), CMP);
  for (int i = 1; i < n; i++) {
    a[i].x += a[0].x;
    a[i].y += a[0].y;
  }
  stack<P> q;
  q.push(a[0]);
  q.push(a[1]);
  int now = 2;
  while (now < n) {
    P p = a[now++];
    P b = q.top();
    if (p == b) continue;
    q.pop();
    P c = q.top();
    while (q.size() > 1 && ((b - c) ^ (p - c)) <= 0) {
      b = c;
      q.pop();
      c = q.top();
    }
    q.push(b);
    q.push(p);
  }
  a.clear();
  while (!q.empty()) {
    a.push_back(q.top());
    q.pop();
  }
  n = a.size();
  reverse(a.begin(), a.end());
  long long ans = 0;
  for (int i = 0; i < n; i++) ans += Dist(a[i], a[(i + 1) % n]);
  cout << ans;
  return 0;
}
