#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
bool operator<(pair<int, int> lhs, pair<int, int> rhs) {
  return (lhs.first == rhs.first) ? (lhs.second < rhs.second)
                                  : (lhs.first < rhs.first);
}
int N;
pair<int, int> Xs[MAXN], Ys[MAXN], X[MAXN], Y[MAXN];
int boxId[MAXN], szBox[MAXN];
int main() {
  scanf("%d", &N);
  int i;
  for (i = 1; i <= N; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    X[i] = Xs[i] = make_pair(x, i);
    Y[i] = Ys[i] = make_pair(y, i);
  }
  sort(Xs + 1, Xs + N + 1);
  sort(Ys + 1, Ys + N + 1);
  long long ans = 0;
  for (i = 1; i <= N / 2; i++) ans -= 2ll * (Xs[i].first + Ys[i].first);
  for (i = N - N / 2 + 1; i <= N; i++) ans += 2ll * (Xs[i].first + Ys[i].first);
  if (N % 2 == 0) {
    for (i = 1; i <= N; i++) boxId[i] = 0;
    for (i = N / 2 + 1; i <= N; i++) boxId[Xs[i].second] |= 2;
    for (i = N / 2 + 1; i <= N; i++) boxId[Ys[i].second] |= 1;
    int cntBoxes[2];
    cntBoxes[0] = cntBoxes[1] = 0;
    for (i = 1; i <= N; i++) cntBoxes[__builtin_popcount(boxId[i]) & 1]++;
    if ((cntBoxes[0]) && (cntBoxes[1]))
      ans -= 2ll * min(Xs[N / 2 + 1].first - Xs[N / 2].first,
                       Ys[N / 2 + 1].first - Ys[N / 2].first);
    cout << ans << endl;
    return 0;
  }
  if (Xs[N / 2 + 1].second == Ys[N / 2 + 1].second) {
    for (i = 1; i <= N; i++) boxId[i] = 0;
    for (i = N - N / 2 + 1; i <= N; i++) boxId[Xs[i].second] |= 2;
    for (i = N - N / 2 + 1; i <= N; i++) boxId[Ys[i].second] |= 1;
    int cntBoxes[2];
    cntBoxes[0] = cntBoxes[1] = 0;
    for (i = 1; i <= N; i++)
      if (i != Xs[N / 2 + 1].second)
        cntBoxes[__builtin_popcount(boxId[i]) & 1]++;
    if ((cntBoxes[0]) && (cntBoxes[1]))
      ans -= 2ll * min(min(Xs[N / 2 + 1].first - Xs[N / 2].first,
                           Xs[N / 2 + 2].first - Xs[N / 2 + 1].first),
                       min(Ys[N / 2 + 1].first - Ys[N / 2].first,
                           Ys[N / 2 + 2].first - Ys[N / 2 + 1].first));
    cout << ans << endl;
    return 0;
  }
  cout << ans << endl;
}
