#include <bits/stdc++.h>
using namespace std;
int x[101010], y[101010], Ix[101010], Iy[101010];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%d%d", x + i, y + i);
  for (int i = 0; i < n; i++) Ix[i] = i;
  for (int i = 0; i < n; i++) Iy[i] = i;
  sort(Ix, Ix + n, [&](int u, int v) { return x[u] < x[v]; });
  sort(Iy, Iy + n, [&](int u, int v) { return y[u] < y[v]; });
  int A = 0, C = 0;
  for (int i = 0; i < n >> 1; i++) {
    A += y[Ix[i]] >= y[Iy[n >> 1]];
    C += y[Ix[i]] <= y[Iy[n - 2 >> 1]];
  }
  int ok = 0;
  for (int i = 0; i < n; i++)
    if (x[i] == x[Ix[n >> 1]] && y[i] == y[Iy[n >> 1]]) ok = 1;
  long long ans = 0;
  sort(x, x + n);
  sort(y, y + n);
  for (int i = 0; i < n >> 1; i++)
    ans = ans - x[i] - y[i] + x[n - 1 - i] + y[n - 1 - i];
  if ((A < (n >> 1)) && (C < (n >> 1))) {
    if (n & 1) {
      if (ok) {
        int t1 = min(x[n >> 1] - x[n - 2 >> 1], y[n >> 1] - y[n - 2 >> 1]);
        int t2 = min(x[n + 1 >> 1] - x[n >> 1], y[n + 1 >> 1] - y[n >> 1]);
        ans -= min(t1, t2);
      }
    } else {
      ans -= min(x[n >> 1] - x[n - 2 >> 1], y[n >> 1] - y[n - 2 >> 1]);
    }
  }
  cout << ans * 2 << endl;
  return 0;
}
