#include <bits/stdc++.h>
using namespace std;
int sx[100050], sy[100050], cx[100050], cy[100050], s[2][2], n, Aha, m;
long long ans;
inline int Read() {
  int x = 0;
  char y;
  do y = getchar();
  while (y < '0' || y > '9');
  do x = x * 10 + y - '0', y = getchar();
  while (y >= '0' && y <= '9');
  return x;
}
int main() {
  m = (n = Read()) + 1 >> 1;
  for (int i = 1; i <= n; i++) cx[i] = sx[i] = Read(), cy[i] = sy[i] = Read();
  sort(sx + 1, sx + n + 1);
  sort(sy + 1, sy + n + 1);
  int dx = sx[m + 1] - sx[m], dy = sy[m + 1] - sy[m];
  if (n & 1) dx = min(dx, sx[m] - sx[m - 1]), dy = min(dy, sy[m] - sy[m - 1]);
  for (int i = 1; i <= n; i++)
    ans += abs(sx[i] - sx[m]) + abs(sy[i] - sy[m]),
        s[cx[i] <= sx[m]][cy[i] <= sy[m]] = true,
                                   Aha |= cx[i] == sx[m] && cy[i] == sy[m];
  if ((!(n & 1) || Aha) && s[0][0] && s[0][1]) ans -= min(dx, dy);
  cout << ans * 2 << endl;
  return 0;
}
