#include <bits/stdc++.h>
using namespace std;
set<pair<int, int> > p;
int n;
int x, y, mnx, mxx, mxy, mny;
int kier[4][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
vector<pair<long long, long long> > pkt;
bool praworll(pair<double, double> X, pair<double, double> Y,
              pair<double, double> Z) {
  return ((Y.first - X.first) * (Z.second - X.second) -
          (Z.first - X.first) * (Y.second - X.second)) <= 0;
}
vector<pair<long long, long long> > otoczka2(
    vector<pair<long long, long long> > ab) {
  sort(ab.begin(), ab.end());
  ab.erase(unique(ab.begin(), ab.end()), ab.end());
  int l = ab.size(), i, j, k;
  vector<pair<long long, long long> > wyn(l + 1);
  if (l < 3) return ab;
  j = 0;
  for (i = 0; i < l; i++) {
    while (j - 2 >= 0 && praworll(wyn[j - 2], wyn[j - 1], ab[i])) j--;
    wyn[j++] = ab[i];
  }
  k = j;
  for (i = l - 2; i >= 0; i--) {
    while (j - 1 >= k && praworll(wyn[j - 2], wyn[j - 1], ab[i])) j--;
    wyn[j++] = ab[i];
  }
  if (wyn[j - 1] == wyn[0]) j--;
  if (j > 1 && ((wyn[j - 1].first - wyn[j - 2].first) *
                    (wyn[0].second - wyn[j - 2].second) -
                (wyn[0].first - wyn[j - 2].first) *
                    (wyn[j - 1].second - wyn[j - 2].second)) == 0)
    j--;
  return vector<pair<long long, long long> >(wyn.begin(), wyn.begin() + j);
}
int main() {
  scanf("%d", &(n));
  ;
  mnx = 20000000;
  mxx = -20000000;
  mny = 20000000;
  mxy = -20000000;
  for (int i = 0; i <= (int)(n)-1; i++) {
    scanf("%d", &(x));
    ;
    scanf("%d", &(y));
    ;
    for (int j = 0; j <= (int)(4) - 1; j++)
      if (!((p).find((make_pair(x + kier[j][0], y + kier[j][1]))) !=
            (p).end())) {
        p.insert(make_pair(x + kier[j][0], y + kier[j][1]));
        pkt.push_back(make_pair(x + kier[j][0], y + kier[j][1]));
      }
  }
  pkt = otoczka2(pkt);
  pkt.push_back(pkt[0]);
  long long w = 0;
  for (int i = 0; i <= (int)(pkt.size() - 1) - 1; i++) {
    x = pkt[i].first - pkt[i + 1].first;
    y = pkt[i].second - pkt[i + 1].second;
    x = abs(x);
    y = abs(y);
    int z = min(x, y);
    w += max(x, y);
  }
  cout << w;
  return 0;
}
