#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
  if (!a) return b;
  return GCD(b % a, a);
}
vector<pair<int, int> > points;
vector<pair<int, int> > hull;
vector<int> inHull;
pair<int, int> SUB(pair<int, int> a, pair<int, int> b) {
  pair<int, int> temp;
  temp.first = a.first - b.first;
  temp.second = a.second - b.second;
  return temp;
}
long long det(pair<int, int> b, pair<int, int> c) {
  return (long long)b.first * (long long)c.second -
         (long long)b.second * (long long)c.first;
}
bool sortByPolarAngle(pair<int, int> p1, pair<int, int> p2) {
  long long turn = det(p1, p2);
  if (turn > 0)
    return true;
  else if (turn == 0) {
    if (abs(p1.first) != abs(p2.first)) return (abs(p1.first) < abs(p2.first));
    return (p1.second < p2.second);
  }
  return false;
}
void grahamScan(vector<pair<int, int> >& points) {
  pair<int, int> lowp;
  lowp.first = lowp.second = 1000000010;
  for (int i = 0; i < points.size(); i++) {
    if ((lowp.second > points[i].second) ||
        (lowp.second == points[i].second && lowp.first > points[i].first)) {
      lowp = points[i];
    }
  }
  for (int i = 0; i < points.size(); i++) {
    points[i].first -= lowp.first;
    points[i].second -= lowp.second;
  }
  sort(points.begin(), points.end(), sortByPolarAngle);
  inHull.push_back(0);
  inHull.push_back(1);
  for (int i = 2; i < points.size(); i++) {
    while (inHull.size() >= 2) {
      pair<int, int> secondLastToLast = SUB(points[inHull[inHull.size() - 1]],
                                            points[inHull[inHull.size() - 2]]);
      pair<int, int> lastToNew =
          SUB(points[i], points[inHull[inHull.size() - 1]]);
      if (det(secondLastToLast, lastToNew) <= 0) {
        inHull.pop_back();
      } else {
        break;
      }
    }
    inHull.push_back(i);
  }
  for (int i = 0; i < inHull.size(); i++) {
    pair<int, int> cur = points[inHull[i]];
    cur.first += lowp.first;
    cur.second += lowp.second;
    hull.push_back(cur);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int first, second;
    scanf("%d%d", &first, &second);
    points.push_back(make_pair(first + 1, second));
    points.push_back(make_pair(first - 1, second));
    points.push_back(make_pair(first, second + 1));
    points.push_back(make_pair(first, second - 1));
  }
  grahamScan(points);
  long long ans = 0;
  int c = hull.size();
  for (int i = 0; i < hull.size(); i++) {
    ans += max(abs(hull[i].first - hull[(i + 1) % c].first),
               abs(hull[i].second - hull[(i + 1) % c].second));
  }
  cout << ans << "\n";
  return 0;
}
