#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long
const int inf = 1e15, N = 1e6 + 1, mod = 998244353;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
main() {
//freopen("cowrect.in", "r", stdin);
//freopen("cowrect.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int n;
cin >> n;
int x[n * 2 + 1], y[n * 2 + 1];
for (int i = 0; i < n * 2; i++) {
cin >> x[i] >> y[i];
}
int mn = inf;
for (int mask = 1; mask < (1 << (n * 2)); mask++) {
vector<pii> a, b;
for (int i = 0; i < n * 2; i++) {
if (mask >> i & 1) {
a.pb({x[i], y[i]});
}else b.pb({x[i], y[i]});
}
if (sz(a) != sz(b)) continue;
sort(all(a));
sort(all(b));
int cur = 0;
for (int i = 1; i <= n; i++) cur += abs(a[i - 1].ff - i) + abs(a[i - 1].ss - 1);
for (int i = 1; i <= n; i++) cur += abs(b[i - 1].ff - i) + abs(b[i - 1].ss - 2);
mn = min(mn, cur);
}
cout << mn;
}
