#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1);
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }
ll n, x[N], y[N], ans = inf;
void rec(string s, ll cnt) {
if (s.sz == 2 * n) {
if (cnt < n || cnt > n) return;
ll res = 0;
pll d = {1, 1}, u = {1, 2};
vector <pair<ll, ll>> a, b;
for (int i = 0; i < s.sz; ++ i) {
if (s[i] == '0') {
a.pb({x[i], y[i]});
} else {
b.pb({x[i], y[i]});
}
}
sort(all(a)); sort(all(b));
for (auto [x, y] : a) {
res += abs(x - d.ft) + abs(y - d.sd);
++ d.ft;
}
for (auto [x, y] : b) {
res += abs(x - u.ft) + abs(y - u.sd);
++ u.ft;
}
ans = min(ans, res);
return;
}
if (cnt + 1 <= n) rec(s + "1", cnt + 1);
rec(s + "0", cnt);
}
const void solve(/*Armashka*/) {
cin >> n;
for (int i = 0; i < n * 2; ++ i) cin >> x[i] >> y[i];
rec("", 0);
cout << ans << "\n";
}
signed main() {
fast;
//freopen("divide.in", "r", stdin);
//freopen("divide.out", "w", stdout);
int tt = 1;
//cin >> tt;
while (tt --) {
solve();
}
}
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/
