#include <bits/stdc++.h>
using namespace std;
const long long MAX_N = 1e5 + 7;
struct point {
  long long x, y;
} p[MAX_N];
bool operator<(point a, point b) {
  if (a.y == b.y) return a.x < b.x;
  return a.y > b.y;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long n;
  cin >> n;
  for (long long i = 0; i < n; ++i) cin >> p[i].x >> p[i].y;
  sort(p, p + n);
  long long ans = 2 * ((p[0].y - p[n - 1].y) + 2);
  long long l, r;
  l = INT_MAX;
  for (long long i = 0; i < n; ++i) l = min(l, (p[0].y - p[i].y) + p[i].x);
  r = -INT_MAX;
  for (long long i = 0; i < n; ++i) r = max(r, p[i].x - (p[0].y - p[i].y));
  ans += r - l;
  l = INT_MAX;
  for (long long i = 0; i < n; ++i) l = min(l, (p[i].y - p[n - 1].y) + p[i].x);
  r = -INT_MAX;
  for (long long i = 0; i < n; ++i) r = max(r, p[i].x - (p[i].y - p[n - 1].y));
  ans += r - l;
  cout << ans << '\n';
  return 0;
}
