#include <bits/stdc++.h>
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
using namespace std;
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e5 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
int n, x[N], y[N], ans, cnt[N][2];
deque < int > need[2], have[2];
main () {
cin >> n;
for (int i = 1; i <= n + n; ++i) {
cin >> x[i] >> y[i];
if (x[i] > n) {
ans += x[i] - n;
x[i] = n;
}
if (x[i] < 1) {
ans += 1 - x[i];
x[i] = 1;
}
if (y[i] > 2) {
ans += y[i] - 2;
y[i] = 2;
}
if (y[i] < 1) {
ans += 1 - y[i];
y[i] = 1;
}
--y[i];
++cnt[x[i]][y[i]];
}
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < 2; ++j) {
for (int x = 0; x < cnt[i][j]; ++x)
have[j].pb(i);
need[j].pb(i);
while (sz(need[j]) && sz(have[j])) {
ans += abs(need[j].front() - have[j].front());
need[j].pop_front();
have[j].pop_front();
}
}
for (int j = 0; j < 2; ++j) {
while (sz(need[j ^ 1]) && sz(have[j])) {
ans += abs(need[j ^ 1].front() - have[j].front()) + 1;
have[j].pop_front();
need[j ^ 1].pop_front();
}
}
}
cout << ans << endl;
}
