#include <bits/stdc++.h>
using namespace std;
const int MAX = 100000 + 10;
int n;
pair<long double, long double> d[MAX];
int cmpx(const pair<long double, long double>& a,
         const pair<long double, long double>& b) {
  return a.first < b.first;
}
int cmpy(const pair<long double, long double>& a,
         const pair<long double, long double>& b) {
  return a.second < b.second;
}
int main() {
  int i;
  scanf("%d", &n);
  for ((i) = (1); (i) <= (n); ++(i)) {
    cin >> d[i].first >> d[i].second;
    d[i].first += i / 10000000.0;
    d[i].second += i / 10000000.0;
  }
  int mid = n / 2 + 1;
  long double midx, midy;
  sort(d + 1, d + n + 1, cmpx);
  if (n % 2 == 1)
    midx = d[mid].first;
  else
    midx = (d[mid - 1].first + d[mid].first) / 2;
  sort(d + 1, d + n + 1, cmpy);
  if (n % 2 == 1)
    midy = d[mid].second;
  else
    midy = (d[mid - 1].second + d[mid].second) / 2;
  int A(0), B(0), C(0), D(0);
  long double ans(0);
  for ((i) = (1); (i) <= (n); ++(i)) {
    if (d[i].first < midx && d[i].second < midy) ++A;
    if (d[i].first > midx && d[i].second < midy) ++B;
    if (d[i].first > midx && d[i].second > midy) ++C;
    if (d[i].first < midx && d[i].second > midy) ++D;
    long double first = floor(d[i].first);
    long double second = floor(d[i].second);
    if (d[i].first < midx)
      ans -= first;
    else
      ans += first;
    if (d[i].second < midy)
      ans -= second;
    else
      ans += second;
  }
  ans *= 2;
  if (n % 2 == 1) {
    ans -= 2 * (floor(midx) + floor(midy));
    int i, flag = 0;
    for ((i) = (1); (i) <= (n); ++(i))
      if (d[i].first == midx && d[i].second == midy) flag = 1;
    if ((!A && !C) || (!B && !D))
      cout << (long long)ans << endl;
    else if (!flag)
      cout << (long long)ans << endl;
    else {
      long double cans = -ans;
      sort(d + 1, d + n + 1, cmpx);
      cans = max(cans,
                 ans + 2 * floor(d[mid].first) - 2 * floor(d[mid + 1].first));
      cans = max(cans,
                 ans - 2 * floor(d[mid].first) + 2 * floor(d[mid - 1].first));
      sort(d + 1, d + n + 1, cmpy);
      cans = max(cans,
                 ans + 2 * floor(d[mid].second) - 2 * floor(d[mid + 1].second));
      cans = max(cans,
                 ans - 2 * floor(d[mid].second) + 2 * floor(d[mid - 1].second));
      cout << (long long)cans << endl;
    }
  } else if (n % 2 == 0) {
    if ((!A && !C) || (!B && !D))
      cout << (long long)ans << endl;
    else {
      long double cans = 0;
      sort(d + 1, d + n + 1, cmpx);
      cans =
          max(cans, ans - 2 * (floor(d[mid].first) - floor(d[mid - 1].first)));
      sort(d + 1, d + n + 1, cmpy);
      cans = max(cans,
                 ans - 2 * (floor(d[mid].second) - floor(d[mid - 1].second)));
      cout << (long long)cans << endl;
    }
  }
  return 0;
}
