#include <bits/stdc++.h>
using namespace std;
const int maxn = 333333, mod = 1000000007;
inline long long read() {
  char ch = getchar();
  long long x = 0, f = 0;
  while (ch < '0' || ch > '9') f |= ch == '-', ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return f ? -x : x;
}
inline int qpow(int a, int b) {
  int ans = 1;
  for (; b; b >>= 1, a = 1ll * a * a % mod)
    if (b & 1) ans = 1ll * ans * a % mod;
  return ans;
}
inline int qmo(int x) { return x + ((x >> 31) & mod); }
int n, x[maxn], y[maxn];
pair<int, int> xx[maxn], yy[maxn];
long long ans;
int main() {
  n = read();
  for (int i = (1); i <= (n); i++) x[i] = read(), y[i] = read();
  for (int i = (1); i <= (n); i++)
    xx[i] = make_pair(x[i], i), yy[i] = make_pair(y[i], i);
  sort(xx + 1, xx + n + 1);
  sort(yy + 1, yy + n + 1);
  if (n % 2) {
    int mid = (n + 1) / 2;
    for (int i = (1); i <= (mid - 1); i++)
      ans -= 2ll * xx[i].first + 2ll * yy[i].first;
    for (int i = (mid + 1); i <= (n); i++)
      ans += 2ll * xx[i].first + 2ll * yy[i].first;
    int at = -1;
    for (int i = (1); i <= (n); i++)
      if (x[i] == xx[mid].first && y[i] == yy[mid].first) at = i;
    bool c1 = false, c2 = false;
    for (int i = (1); i <= (n); i++)
      if (i != at) {
        if ((x[i] <= xx[mid].first) ^ (y[i] <= yy[mid].first))
          c1 = true;
        else
          c2 = true;
      }
    if (~at && c1 && c2) {
      int t1 = min(xx[mid].first - xx[mid - 1].first,
                   xx[mid + 1].first - xx[mid].first);
      int t2 = min(yy[mid].first - yy[mid - 1].first,
                   yy[mid + 1].first - yy[mid].first);
      ans -= 2ll * min(t1, t2);
    }
  } else {
    int mid = n / 2;
    bool c1 = false, c2 = false;
    for (int i = (1); i <= (n); i++) {
      if ((x[i] <= xx[mid].first) ^ (y[i] <= yy[mid].first))
        c1 = true;
      else
        c2 = true;
    }
    for (int i = (1); i <= (mid); i++)
      ans -= 2ll * xx[i].first + 2ll * yy[i].first;
    for (int i = (mid + 1); i <= (n); i++)
      ans += 2ll * xx[i].first + 2ll * yy[i].first;
    if (c1 && c2) {
      int t1 = xx[mid + 1].first - xx[mid].first;
      int t2 = yy[mid + 1].first - yy[mid].first;
      ans -= 2ll * min(t1, t2);
    }
  }
  printf("%lld\n", ans);
}
