#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define ll long long
#define ii pair<int, int>
#define pl pair<ll, ll>
#define f1 first
#define s2 second
int main()
{
ios :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<pl> v(2*n);
for (auto &[x, y] : v)
cin >> x >> y;
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < 2*n; i += 2)
{
ans += abs(v[i].f1 - (i/2 + 1)) + abs(v[i+1].f1 - (i/2 + 1)) + min(abs(v[i].s2 - 1) + abs(v[i+1].s2 - 2), abs(v[i].s2 - 2) + abs(v[i+1].s2 - 1));
}
cout << ans << '\n';
return 0;
}
