#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int N;
cin >> N;
int totalCoins = 2 * N;
vector<pair<long long, long long>> coins(totalCoins);
for (int i = 0; i < totalCoins; ++i) {
cin >> coins[i].first >> coins[i].second;
}
sort(coins.begin(), coins.end());
vector<pair<long long, long long>> targetPositions(totalCoins);
for (int i = 0; i < N; ++i) {
targetPositions[2 * i] = {i + 1, 1};
targetPositions[2 * i + 1] = {i + 1, 2};
}
sort(targetPositions.begin(), targetPositions.end());
long long totalOperations = 0;
for (int i = 0; i < totalCoins; ++i) {
totalOperations += abs(coins[i].first - targetPositions[i].first) + abs(coins[i].second - targetPositions[i].second);
}
cout << totalOperations << endl;
return 0;
}
