#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  vector<pair<int, int>> a(n);
  for (auto &[x, y] : a)
    cin >> x >> y;

  int mxx = -1e9, mix = 1e9, mxy = -1e9, miy = 1e9;
  for (auto [x, y] : a) {
    mxx = max(mxx, x);
    mix = min(mix, x);
    mxy = max(mxy, y);
    miy = min(miy, y);
  }

  int ans = (mxx - mix) * 2 + (mxy - miy) * 2 + 8;
  set<int> major, minor;
  for (auto [x, y] : a) {
    major.insert(x + y);
    minor.insert(x - y);
  }

  for (int x = mix - 1; x <= mxx + 1; ++x) {
    const int y = mxy + 1;
    if (minor.find(x - y) != minor.end()) {
      ans -= x - mix;
      break;
    }
  }
  for (int x = mix - 1; x <= mxx + 1; ++x) {
    const int y = miy - 1;
    if (major.find(x + y) != major.end()) {
      ans -= x - mix;
      break;
    }
  }
  for (int x = mxx + 1; x >= mix - 1; --x) {
    const int y = mxy + 1;
    if (major.find(x + y) != major.end()) {
      ans -= mxx - x;
      break;
    }
  }
  for (int x = mxx + 1; x >= mix - 1; --x) {
    const int y = miy - 1;
    if (minor.find(x - y) != minor.end()) {
      ans -= mxx - x;
      break;
    }
  }

  if ((major.size() == 1) ^ (minor.size() == 1)) {
    ans += 1;
  }

  cout << ans << '\n';
  return 0;
}