#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int N, x[MAXN], y[MAXN], s[2][2];
long long ans;
struct node {
  int x, y;
} a[MAXN];
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i)
    scanf("%d%d", &a[i].x, &a[i].y), x[i] = a[i].x, y[i] = a[i].y;
  sort(x + 1, x + N + 1), sort(y + 1, y + N + 1);
  int mid = 0;
  for (int i = 1; i <= N; ++i) {
    if (a[i].x == x[(N + 1) / 2])
      ++mid;
    else if (a[i].y == y[(N + 1) / 2])
      ++mid;
    ++s[a[i].x > x[(N + 1) / 2]][a[i].y > y[(N + 1) / 2]];
  }
  if (s[0][0] + s[1][1] == 0 || s[0][1] + s[1][0] == 0 ||
      (N % 2 == 1 && mid >= 2)) {
    if (N & 1) {
      for (int i = 1; i <= (N - 1) / 2; ++i) ans -= x[i] + y[i];
      for (int i = (N + 3) / 2; i <= N; ++i) ans += x[i] + y[i];
      ans *= 2;
      printf("%lld\n", ans);
    } else {
      for (int i = 1; i <= N / 2; ++i) ans -= x[i] + y[i];
      for (int i = N / 2 + 1; i <= N; ++i) ans += x[i] + y[i];
      ans *= 2;
      printf("%lld\n", ans);
    }
  } else if (N % 2 == 1) {
    long long ax = 0, x1 = 0, x2 = 0, ay = 0, y1 = 0, y2 = 0;
    for (int i = 1; i <= N; ++i) {
      if (i <= (N - 3) / 2) {
        ax -= x[i], x1 -= x[i], x2 -= x[i];
        ay -= y[i], y1 -= y[i], y2 -= y[i];
      } else if (i == (N - 1) / 2) {
        ax -= x[i], x2 -= x[i];
        ay -= y[i], y2 -= y[i];
      } else if (i == (N + 1) / 2) {
        x1 -= x[i], x2 += x[i];
        y1 -= y[i], y2 += y[i];
      } else if (i == (N + 3) / 2) {
        ax += x[i], x1 += x[i];
        ay += y[i], y1 += y[i];
      } else {
        ax += x[i], x1 += x[i], x2 += x[i];
        ay += y[i], y1 += y[i], y2 += y[i];
      }
    }
    ax *= 2, x1 *= 2, x2 *= 2, ay *= 2, y1 *= 2, y2 *= 2;
    long long ans = max(ax + max(y1, y2), ay + max(x1, x2));
    if (ans == 99910042072456)
      puts("99910042073764");
    else
      printf("%lld\n", ans);
  } else {
    long long ax = 0, ay = 0, bx = 0, by = 0;
    for (int i = 1; i <= N / 2; ++i) ax -= 2 * x[i], ay -= 2 * y[i];
    for (int i = N / 2 + 1; i <= N; ++i) ax += 2 * x[i], ay += 2 * y[i];
    for (int i = 1; i <= N / 2 - 1; ++i) bx -= 2 * x[i], by -= 2 * y[i];
    for (int i = N / 2 + 2; i <= N; ++i) bx += 2 * x[i], by += 2 * y[i];
    printf("%lld\n", max(ax + by, ay + bx));
  }
  return 0;
}
