#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
struct PT {
  long long x, y;
  PT() {}
  PT(long long x, long long y) : x(x), y(y) {}
  PT(const PT &p) : x(p.x), y(p.y) {}
  PT operator+(const PT &p) const { return PT(x + p.x, y + p.y); }
  PT operator-(const PT &p) const { return PT(x - p.x, y - p.y); }
  PT operator*(long long c) const { return PT(x * c, y * c); }
  PT operator/(long long c) const { return PT(x / c, y / c); }
  bool operator<(const PT &p) const {
    return make_pair(x, y) < make_pair(p.x, p.y);
  }
};
double dot(PT p, PT q) { return p.x * q.x + p.y * q.y; }
double dist2(PT p, PT q) { return dot(p - q, p - q); }
double cross(PT p, PT q) { return p.x * q.y - p.y * q.x; }
istream &operator>>(istream &is, PT &p) { return is >> p.x >> p.y; }
ostream &operator<<(ostream &os, const PT &p) {
  return os << "(" << p.x << "," << p.y << ")";
}
vector<PT> convex(vector<PT> &in) {
  if ((int)in.size() <= 2) {
    return in;
  }
  vector<PT> res;
  res.push_back(in[0]);
  for (int i = 1; i < in.size(); i++) {
    if (in[i].x == res.back().x && in[i].y == res.back().y) {
      continue;
    }
    while ((int)res.size() >= 2 && cross(res.back() - res[res.size() - 2],
                                         in[i] - res[res.size() - 2]) < 0)
      res.pop_back();
    res.push_back(in[i]);
  }
  int t = (int)res.size();
  for (int i = in.size() - 1; i >= 0; i--) {
    if (in[i].x == res.back().x && in[i].y == res.back().y) {
      continue;
    }
    while ((int)res.size() >= t + 1 && cross(res.back() - res[res.size() - 2],
                                             in[i] - res[res.size() - 2]) < 0)
      res.pop_back();
    res.push_back(in[i]);
  }
  res.pop_back();
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int N;
  cin >> N;
  vector<PT> po(4 * N);
  for (int i = 0; i < 4 * N; i += 4) {
    cin >> po[i];
    po[i + 1] = po[i];
    po[i + 2] = po[i];
    po[i + 3] = po[i];
    po[i].x++;
    po[i + 1].x--;
    po[i + 2].y++;
    po[i + 3].y--;
  }
  sort(po.begin(), po.end());
  po = convex(po);
  long long res = 0;
  for (int i = 0; i < (int)po.size(); i++) {
    int j = (i + 1) % (int)po.size();
    res += max(abs(po[i].x - po[j].x), abs(po[i].y - po[j].y));
  }
  cout << res << '\n';
  return 0;
}
