#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

// 縦にする辺
ll dpa[1<<16][16],dpb[1<<16][16],dpc[1<<16][16];

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n;cin>>n;
    ll a[n],b[n],c[n];
    rep(i,n){
        cin>>a[i]>>b[i]>>c[i];
        dpa[1<<i][i]=a[i];
        dpb[1<<i][i]=b[i];
        dpc[1<<i][i]=c[i];
    }

    for(int bit=0;bit<(1<<n);bit++){
        rep(i,n)if((bit>>i)&1){
            rep(j,n)if(((bit>>j)&1)==0){
                // i: last, j: nxt
                // a
                ll ln=max(b[i],c[i]),sh=min(b[i],c[i]);
                if(max(b[j],c[j])<=ln and min(b[j],c[j])<=sh) chmax(dpa[bit|(1<<j)][j],dpa[bit][i]+a[j]);
                if(max(a[j],c[j])<=ln and min(a[j],c[j])<=sh) chmax(dpb[bit|(1<<j)][j],dpa[bit][i]+b[j]);
                if(max(a[j],b[j])<=ln and min(a[j],b[j])<=sh) chmax(dpc[bit|(1<<j)][j],dpa[bit][i]+c[j]);
                // b
                ln=max(a[i],c[i]),sh=min(a[i],c[i]);
                if(max(b[j],c[j])<=ln and min(b[j],c[j])<=sh) chmax(dpa[bit|(1<<j)][j],dpb[bit][i]+a[j]);
                if(max(a[j],c[j])<=ln and min(a[j],c[j])<=sh) chmax(dpb[bit|(1<<j)][j],dpb[bit][i]+b[j]);
                if(max(a[j],b[j])<=ln and min(a[j],b[j])<=sh) chmax(dpc[bit|(1<<j)][j],dpb[bit][i]+c[j]);
                // c
                ln=max(b[i],a[i]),sh=min(b[i],a[i]);
                if(max(b[j],c[j])<=ln and min(b[j],c[j])<=sh) chmax(dpa[bit|(1<<j)][j],dpc[bit][i]+a[j]);
                if(max(a[j],c[j])<=ln and min(a[j],c[j])<=sh) chmax(dpb[bit|(1<<j)][j],dpc[bit][i]+b[j]);
                if(max(a[j],b[j])<=ln and min(a[j],b[j])<=sh) chmax(dpc[bit|(1<<j)][j],dpc[bit][i]+c[j]);
            }
        }
    }
    ll ans=0;
    rep(i,(1<<n)){
        rep(j,n){
            chmax(ans,dpa[i][j]);
            chmax(ans,dpb[i][j]);
            chmax(ans,dpc[i][j]);
        }
    }
    cout<<ans<<endl;
    return 0;
}