#include <bits/stdc++.h>
using namespace std;
int n, m, a[100010], b[100010], x[100010], y[100010], del, falg, mid;
long long ans = 0;
int main() {
  scanf("%d", &n), m = (n + 1) / 2;
  for (int i = 1; i <= n; i++)
    scanf("%d%d", &x[i], &y[i]), a[i] = x[i], b[i] = y[i];
  sort(a + 1, a + n + 1), sort(b + 1, b + n + 1);
  del = min(a[m + 1] - a[m], b[m + 1] - b[m]);
  if (n & 1) del = min(del, min(a[m] - a[m - 1], b[m] - b[m - 1]));
  for (int i = 1; i <= n; i++) {
    ans += abs(x[i] - a[m]) + abs(y[i] - b[m]);
    falg |= (x[i] > a[m] && y[i] > b[m]) << 1;
    falg |= (x[i] > a[m] && y[i] <= b[m]);
    mid |= (x[i] == a[m] && y[i] == b[m]);
  }
  if (falg == 3 && (!(n & 1) || mid)) ans -= del;
  printf("%lld\n", ans * 2);
}
