#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int N;
long long x[MAXN], y[MAXN];
pair<int, int> cities[MAXN];
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> x[i] >> y[i];
    cities[i] = make_pair(x[i], y[i]);
  }
  sort(x, x + N);
  sort(y, y + N);
  double vmed = y[N / 2], hmed = x[N / 2];
  if (N % 2 == 0) {
    vmed = (vmed + y[N / 2 - 1]) / 2;
    hmed = (hmed + x[N / 2 - 1]) / 2;
  }
  long long ans = 0;
  for (int i = 0; i < N; i++) {
    if (2 * i < N)
      ans -= 2LL * (x[i] + y[i]);
    else
      ans += 2LL * (x[i] + y[i]);
  }
  bool bl = false, br = false, tl = false, tr = false;
  for (int i = 0; i < N; i++) {
    if (cities[i].first < hmed && cities[i].second < vmed)
      bl = true;
    else if (cities[i].first > hmed && cities[i].second < vmed)
      br = true;
    else if (cities[i].first < hmed && cities[i].second > vmed)
      tl = true;
    else if (cities[i].first > hmed && cities[i].second > vmed)
      tr = true;
  }
  if (N & 1) {
    int mid = N / 2;
    ans += 2LL * (y[mid] + x[mid]);
    if (bl + br + tl + tr <= 2) {
      cout << ans << endl;
      return 0;
    }
    int p = 0;
    bool vert = false, horiz = false;
    for (int i = 0; i < N; i++) {
      if (cities[i].first == hmed) {
        horiz = true;
        p++;
      }
      if (cities[i].second == vmed) {
        vert = true;
        if (cities[i].first != hmed) p++;
      }
    }
    if (p >= 2 && vert && horiz)
      cout << ans << endl;
    else {
      long long vadd = max(-y[mid] + (long long)y[mid - 1],
                           y[mid] - (long long)y[mid + 1]),
                hadd = max(-x[mid] + (long long)x[mid - 1],
                           x[mid] - (long long)x[mid + 1]);
      ans += 2 * max(vadd, hadd);
      cout << ans << endl;
    }
  } else {
    if (bl + br + tl + tr <= 2) {
      cout << ans << endl;
      return 0;
    }
    int mid = N / 2 - 1;
    if (y[mid + 1] - y[mid] > x[mid + 1] - x[mid])
      ans -= 2 * (x[mid + 1] - x[mid]);
    else
      ans -= 2 * (y[mid + 1] - y[mid]);
    cout << ans << endl;
  }
  return 0;
}
