#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
int dist(int x1, int y1, int x2, int y2) {return (abs(x1 - x2) + abs(y1 - y2));}
int dist2(int slot, int x1, int y1, int x2, int y2) {
if (y1 < y2) {
swap(x1, x2);
swap(y1, y2);
}
int ans = dist(x1, y1, slot, 2) + dist(x2, y2, slot, 1);
assert(ans >= 0);
return ans;
}
inline void solve() {
int n; cin >> n;
map<int, multiset<int>> m;
for (int i = 0; i < 2*n; i++) {
int x, y;
cin >> x >> y;
m[x].insert(y);
}
vector<pair<int, multiset<int>>> v; for (auto &x : m) v.pb(x);
int slot = 1, ans = 0;
for (int i = 0; i < v.size(); i++) {
int x = v[i].fi;
multiset<int> ys = v[i].se;
// cout << "X: " << x << '\n';
// for (auto &y : ys) cout << y << " ";
// cout << '\n';
while (ys.size() > 1) {
int tp = *ys.begin(); ys.erase(ys.begin()); int bt = *ys.begin();
// cout << "slot: " << slot << " and points " << x << " " << tp << " " << x << " " << bt << '\n';
ans += dist2(slot, x, tp, x, bt);
slot++;
ys.erase(ys.begin());
}
if (ys.size() == 1) {
// one left over
// do shenanigans
int y = *ys.begin();
assert(i != v.size() - 1);
// if (i == v.size() - 1) break;
int xnext = v[i + 1].fi;
int ynext;
assert(v[i + 1].se.size() > 0);
if (y >= 2) {
// top
// pick a bottom
ynext = *v[i + 1].se.begin();
v[i + 1].se.erase(v[i + 1].se.begin());
} else {
// bottom
// pick a top
ynext = *v[i + 1].se.rbegin();
auto it = v[i + 1].se.end(); it--;
v[i + 1].se.erase(it);
}
ans += dist2(slot, x, y, xnext, ynext);
slot++;
}
}
cout << ans << '\n';
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}
