#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
const long long INF = 1e9 + 7;
const long long N = 1e5 + 5;
const long double EPS = 1e-12;
long long first[N], second[N];
void solve() {
  long long n;
  cin >> n;
  long long max_sum = -INF, min_sum = INF, max_dif = -INF, min_dif = INF;
  for (long long i = 0; i < n; i++) {
    cin >> first[i] >> second[i];
    max_sum = max(max_sum, first[i] + second[i]);
    min_sum = min(min_sum, first[i] + second[i]);
    min_dif = min(min_dif, first[i] - second[i]);
    max_dif = max(max_dif, first[i] - second[i]);
  }
  long long x_min = *min_element(first, first + n) - 1;
  long long x_max = *max_element(first, first + n) + 1;
  long long y_min = *min_element(second, second + n) - 1;
  long long y_max = *max_element(second, second + n) + 1;
  min_dif--;
  min_sum--;
  max_dif++;
  max_sum++;
  long long len = 2 * (y_max - y_min) + 2 * (x_max - x_min);
  len -= abs(y_max + x_max - max_sum);
  len -= abs(max_dif - x_max + y_min);
  len -= abs(min_sum - x_min - y_min);
  len -= abs(min_dif - x_min + y_max);
  cout << len;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long tests = 1;
  while (tests-- > 0) {
    solve();
  }
  return 0;
}
