#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
int n;
vector<pair<int, int> > v1;
vector<pair<int, int> > v2;
int diff1[N], diff11[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    v1.push_back({x, y});
    v2.push_back({y, x});
  }
  sort(v1.begin(), v1.end());
  sort(v2.begin(), v2.end());
  int sum = 0, sum2 = 0;
  for (int i = 1; i < v1.size(); i++) {
    sum += v1[i].first - v1[i - 1].first;
    diff1[i] = sum;
  }
  for (int i = v1.size() - 2; i >= 0; i--) {
    sum2 += abs(v1[i].second - v1[i + 1].second);
    diff11[i] = sum2;
  }
  long long ans = 4e9;
  for (int i = 0; i < v1.size(); i++) {
    ans = min((long long)diff1[i] + diff11[i + 1], ans);
  }
  sum = 0, sum2 = 0;
  for (int i = 1; i < v2.size(); i++) {
    sum += v2[i].first - v2[i - 1].first;
    diff1[i] = sum;
  }
  for (int i = v2.size() - 2; i >= 0; i--) {
    sum2 += abs(v2[i].second - v2[i + 1].second);
    diff11[i] = sum2;
  }
  for (int i = 0; i < v1.size(); i++) {
    ans = min((long long)diff1[i] + diff11[i + 1], ans);
  }
  cout << ans << endl;
}
