#include <bits/stdc++.h>
using namespace std;
int n, nn, m;
int xx[100005], yy[100005];
pair<int, int> p[500005];
pair<int, int> pp;
int sign(long long x) {
  if (x < 0LL) return -1;
  if (x > 0LL) return +1;
  return 0;
}
long long vp(long long x1, long long y1, long long x2, long long y2) {
  return x1 * y2 - x2 * y1;
}
long long dist2(long long x1, long long y1, long long x2, long long y2) {
  return (x1 - x2) * (x1 - x2) + (y1 - y1) * (y1 - y2);
}
bool paless(pair<int, int> a, pair<int, int> b) {
  int s = sign(vp(a.first - pp.first, a.second - pp.second, b.first - pp.first,
                  b.second - pp.second));
  if (s == 0)
    return dist2(pp.first, pp.second, a.first, a.second) <
           dist2(pp.first, pp.second, b.first, b.second);
  return s > 0;
}
bool check(pair<int, int> p, pair<int, int> a, pair<int, int> b) {
  int s = sign(vp(a.first - p.first, a.second - p.second, b.first - p.first,
                  b.second - p.second));
  return s <= 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d%d", &xx[i], &yy[i]);
  nn = 0;
  for (int i = 0; i < n; ++i) {
    p[nn++] = make_pair(xx[i] + 1, yy[i]);
    p[nn++] = make_pair(xx[i] - 1, yy[i]);
    p[nn++] = make_pair(xx[i], yy[i] + 1);
    p[nn++] = make_pair(xx[i], yy[i] - 1);
  }
  sort(p, p + nn);
  nn = 0;
  for (int i = 0; i < 4 * n; ++i)
    if (i == 0 || p[i - 1] != p[i]) p[nn++] = p[i];
  for (int i = 1; i < nn; ++i)
    if (p[i].second < p[0].second ||
        (p[i].second == p[0].second && p[i].first < p[0].first))
      swap(p[i], p[0]);
  pp = p[0];
  sort(p + 1, p + nn, paless);
  vector<pair<int, int> > h;
  h.push_back(p[0]);
  h.push_back(p[1]);
  for (int i = 2; i < nn; ++i) {
    int t = ((int)(h).size());
    while (t > 2 && check(h[t - 2], h[t - 1], p[i])) h.pop_back(), --t;
    h.push_back(p[i]);
  }
  m = ((int)(h).size());
  h.push_back(h[0]);
  long long res = 0LL;
  for (int i = 0; i < m; ++i)
    res += max(abs(h[i].first - h[i + 1].first),
               abs(h[i].second - h[i + 1].second));
  cout << res << endl;
  return 0;
}
