#include <bits/stdc++.h>
using namespace std;
const int INF = 10001000;
int lx = INF, rx = -INF, ly = INF, ry = -INF, la = INF, ra = -INF, ld = INF,
    rd = -INF;
void add(int x, int y) {
  lx = min(lx, x);
  rx = max(rx, x);
  ly = min(ly, y);
  ry = max(ry, y);
  la = min(la, x + y);
  ra = max(ra, x + y);
  ld = min(ld, x - y);
  rd = max(rd, x - y);
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    add(x, y);
    add(x, y - 1);
    add(x, y + 1);
    add(x - 1, y);
    add(x + 1, y);
  }
  vector<pair<int, int> > v;
  v.push_back(pair<int, int>(rx, ra - rx));
  v.push_back(pair<int, int>(ra - ry, ry));
  v.push_back(pair<int, int>(ld + ry, ry));
  v.push_back(pair<int, int>(lx, lx - ld));
  v.push_back(pair<int, int>(lx, la - lx));
  v.push_back(pair<int, int>(la - ly, ly));
  v.push_back(pair<int, int>(rd + ly, ly));
  v.push_back(pair<int, int>(rx, rx - rd));
  int sum = 0;
  int tlen = (int)v.size();
  for (int i = 0; i < tlen; i++) {
    sum += max(abs(v[i].first - v[(i + 1) % tlen].first),
               abs(v[i].second - v[(i + 1) % tlen].second));
  }
  cout << sum << endl;
}
