#include <bits/stdc++.h>
using namespace std;
long long n, idx, mn, b, c, ans;
struct node {
  long long x, y, id;
  bool xx, yy;
} a[300005];
bool cmp_x(node q, node p) { return q.x < p.x; }
bool cmp_y(node q, node p) { return q.y < p.y; }
bool cmp_id(node q, node p) { return q.id < p.id; }
inline long long read() {
  long long red = 0, f_f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f_f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') red = red * 10 + ch - '0', ch = getchar();
  return red * f_f;
}
signed main() {
  n = read();
  for (long long i = 1; i <= n; i++)
    a[i].x = read(), a[i].y = read(), a[i].id = i;
  if (n & 1) {
    sort(a + 1, a + 1 + n, cmp_x);
    idx = a[n / 2 + 1].id;
    for (long long i = 1; i <= n / 2; i++) ans -= 2ll * a[i].x, a[i].xx = 0;
    for (long long i = n / 2 + 2; i <= n; i++) ans += 2ll * a[i].x, a[i].xx = 1;
    sort(a + 1, a + 1 + n, cmp_y);
    for (long long i = 1; i <= n / 2; i++) ans -= 2ll * a[i].y, a[i].yy = 0;
    for (long long i = n / 2 + 2; i <= n; i++) ans += 2ll * a[i].y, a[i].yy = 1;
    if (idx == a[n / 2 + 1].id) {
      mn = 2000000000ll, b = c = 0;
      for (long long i = 1; i <= n; i++)
        if (i != n / 2 + 1) {
          if (a[i].xx == a[i].yy)
            c++;
          else
            b++;
          mn = min(mn, min(abs(a[i].x - a[n / 2 + 1].x),
                           abs(a[i].y - a[n / 2 + 1].y)));
        }
      if (b && c) ans -= 2ll * mn;
    }
  } else {
    sort(a + 1, a + 1 + n, cmp_x);
    mn = a[n / 2 + 1].x - a[n / 2].x;
    for (long long i = 1; i <= n / 2; i++) ans -= 2ll * a[i].x, a[i].xx = 0;
    for (long long i = n / 2 + 1; i <= n; i++) ans += 2ll * a[i].x, a[i].xx = 1;
    sort(a + 1, a + 1 + n, cmp_y);
    mn = min(mn, a[n / 2 + 1].y - a[n / 2].y);
    for (long long i = 1; i <= n / 2; i++) ans -= 2ll * a[i].y, a[i].yy = 0;
    for (long long i = n / 2 + 1; i <= n; i++) ans += 2ll * a[i].y, a[i].yy = 1;
    b = c = 0;
    for (long long i = 1; i <= n; i++) {
      if (a[i].xx == a[i].yy)
        c++;
      else
        b++;
    }
    if (b && c) ans -= 2ll * mn;
  }
  printf("%lld\n", ans);
  return 0;
}
