#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#define ll long long#define sqr(x) ((x)*(x))#define ln(x,y) int(log(x)/log(y))usingnamespacestd;
constchar* fin="aP2.in";
constchar* fout="aP2.out";
constint inf=0x7fffffff;
constint maxn=17,maxk=1<<maxn;
constint w[3][3]={{0,1,2},{0,2,1},{1,2,0}};
int n,i,j,k,l,o;
int a[maxn][3];
ll f[maxk][maxn][3];
ll ans;
int main(){
scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]);
sort(a[i],a[i]+3);
}
for (i=0;i<1<<n;i++)
for (j=1;j<=n;j++)
for (k=0;k<3;k++){
if (i==((1<<n)-1)) continue;
for (l=1;l<=n;l++){
if (i&(1<<(l-1))) continue;
for (o=0;o<3;o++){
if (a[l][w[o][0]]<=a[j][w[k][0]] && a[l][w[o][1]]<=a[j][w[k][1]]){
f[i|(1<<(l-1))][l][o]=max(f[i][j][k]+a[l][w[o][2]],f[i|(1<<(l-1))][l][o]);
ans=max(ans,f[i|(1<<(l-1))][l][o]);
}
}
}
}
printf("%lld",ans);
return0;
}