//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
//#include<ctime>
//#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;

ll gcd(ll a,ll b){
  if(b == 0) return a;
  return gcd(b , a % b);
}

const ll MOD = 1000000007;
const ll MAX = 2000001;

ll mod(ll a){
  return a % MOD;
}

ll lcm(ll a,ll b){
  return (a*b)/gcd(a,b);
}


struct UnionFind {
    //自身が親であれば、その集合に属する頂点数に-1を掛けたもの
    //そうでなければ親のid
    vector<int> r;
 
    UnionFind(int N) {
        r = vector<int>(N, -1);
    }
 
    int root(int x) {
        if (r[x] < 0) return x;
        return r[x] = root(r[x]);
    }
 
    bool unite(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (r[x] > r[y]) swap(x, y);
        r[x] += r[y];
        r[y] = x;
        return true;
    }
 
    int size(int x) {
        return -r[root(x)];
    }
  
};




int main(){
  ll n; cin >> n;
  vvl cost(n,vl(n));

  vl x(n); vl y(n); vl z(n);
  rep(i,n) cin >> x[i] >> y[i] >> z[i];
  
  
  rep(i,n){
    rep(j,n){
      //各都市から各都市へのコストを計算
      cost[i][j] = abs(x[j] - x[i]) + abs(y[j] - y[i]) + max(0LL,z[j] - z[i]);
    }
  }

  ll inf = 1e18;
  vvl dp((1<<n),vl(n,inf)); //dp[訪れた都市の集合][最後に訪れた都市]

  dp[1][0] = 0; //最初は都市1(0-indexedでは0)にいるのでコスト0

  for(ll i=1; i < (1<<n); i++){ //都市の集合のループ
    if(i % 2 == 0) continue; //都市1には行ったことがあるので，必ず奇数になる

    for(ll j=1; j < n; j++){ //これから向かう都市のループ
      if(i & (1<<j)) continue; //訪れたことのある都市に向かおうとしていたらcontinue

      for(ll k=0; k < n; k++){ //最後に来た都市のループ
        if(!(i&(1<<k))) continue; //まだ訪れていない都市からやってこようとしたらcontinue

        //もともとの行き方よりも,訪れた都市集合がi,最後に来た都市kの状態で,
        //これから都市jに向かった方がコストがかからない場合，更新

        if(dp[i|(1<<j)][j] > dp[i][k] + cost[k][j]){
          dp[i|(1<<j)][j] = dp[i][k] + cost[k][j];
        }
      }
    }
  }

  ll ans = 1e18;

  rep(i,n){
    //全ての都市を回った状態で，都市1に戻ってくる
    ans = min(dp[(1<<n)-1][i] + cost[i][0],ans);
  } 

  cout << ans << endl;


}
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

void solve() {
	int n; cin >> n;
	vector<int> l(n + 1, mod);
	vector<int> r(n + 1, -mod);
	rep(i, n) {
		int x, c; cin >> x >> c;
		l[c] = min(l[c], x);
		r[c] = max(r[c], x);
	}
	vector<LP> dp;
	dp.push_back({ 0,0 });
	rep1(c, n) {
		if (l[c] == mod)continue;
		ll lval = INF, rval = INF;
		for (LP p : dp) {
			ll loc = p.first;
			ll val = p.second;
			lval = min(lval, val + abs(r[c] - loc) + r[c] - l[c]);
			rval = min(rval, val + abs(l[c] - loc) + r[c] - l[c]);
		}
		dp.clear();
		dp.push_back({ l[c],lval });
		dp.push_back({ r[c],rval });
	}
	ll ans = INF;
	for (LP p : dp) {
		ll loc = p.first;
		ll val = p.second;
		ans = min(ans, abs(loc) + val);
	}
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
		solve();
	return 0;
}