#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int Maxn = 200010, Maxm = 100005, Mo = 1000000007,
          sp[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const long long oo = INT_MAX >> 2;
struct Tree {
  int l, r, cnt;
};
struct edge {
  int u, v, len;
};
typedef int IArr[Maxn];
typedef long long LArr[Maxn];
typedef double DArr[Maxn];
LArr x, y, sx, sy;
long long n, i, j, ans;
int s[2][2];
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (i = 1; i <= n; i++) cin >> x[i] >> y[i], sx[i] = x[i], sy[i] = y[i];
  sort(x + 1, x + n + 1);
  sort(y + 1, y + n + 1);
  long long m = (n + 1) / 2;
  long long dx = x[m + 1] - x[m];
  long long dy = y[m + 1] - y[m];
  if (n & 1) dx = min(dx, x[m] - x[m - 1]), dy = min(dy, y[m] - y[m - 1]);
  int ck = 0;
  for (i = 1; i <= n; i++) {
    ans += abs(x[i] - x[m]) + abs(y[i] - y[m]);
    s[sx[i] <= x[m]][sy[i] <= y[m]] = 1;
    ck = ck || (sx[i] == x[m] && sy[i] == y[m]);
  }
  if (n & 1 && !ck) {
    cout << ans * 2 << endl;
    return 0;
  }
  if (s[0][0] && s[0][1]) ans = max(ans - dx, ans - dy);
  cout << ans * 2 << endl;
}
