#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
const int maxn=20;
typedef long long ll;
ll f[1<<maxn][maxn],dis[maxn][maxn];
int n,x[maxn],y[maxn],z[maxn],mmax;
int main(){
	memset(f,0x3f,sizeof(f));
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d%d",&x[i],&y[i],&z[i]);
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			dis[i][j]=std::abs(x[i]-x[j])+std::abs(y[i]-y[j])+std::max(z[j]-z[i],0);
		}
		f[1|(1<<(i-1))][i]=dis[1][i]+dis[i][1];
	}
	mmax=(1<<n)-1;
	for(int i=1;i<=mmax;i++){
		for(int j=1;j<=n;j++){
			if(i&(1<<(j-1))){
				for(int k=1;k<=n;k++){
					if(i&(1<<(k-1))) continue;
					f[i|(1<<(k-1))][k]=std::min(f[i^(1<<(k-1))][k],f[i][j]+dis[j][k]);
					f[i|(1<<(k-1))][k]=std::min(f[i^(1<<(k-1))][k],f[i][j]+dis[1][k]+dis[j][1]);
				}
			}
		}
	}
	long long ans=0x3f3f3f3f3f3f3f3f;
	for(int i=1;i<=n;i++){
		ans=std::min(ans,f[mmax][i]+dis[i][1]);
	}
	printf("%lld\n",ans);
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

int main(){
    ll n;cin>>n;
    vi x(n),y(n),z(n);
    rep(i,n)cin>>x[i]>>y[i]>>z[i];
    vvi dp(n,vi(1<<n,inf));
    dp[0][0]=0;
    SPQ(PP) pq;
    pq.push(PP(0,0,0));
    while(!pq.empty()){
        auto t=pq.top();pq.pop();
        ll cost,i,bit;tie(cost,i,bit)=t;
        if(cost!=dp[i][bit])continue;
        rep(j,n)if(chmin(dp[j][bit|(1<<j)],cost+abs(x[i]-x[j])+abs(y[i]-y[j])+max(0ll,z[j]-z[i])))pq.push(PP(dp[j][bit|(1<<j)],j,bit|(1<<j)));
    }
    out(dp[0][(1<<n)-1]);
}