#include<bits/stdc++.h>
using namespace std;
using ll = long long;
bool ok(int a,int b,int c,int d){
    if(a>=c&&b>=d) return true;
    if(a>=d&&b>=c) return true;
    return false;
    return (a>=c&&b>=d) || (a>=d&&b>=c);
}

#define chmax(a,b) a = max(a,b)

int main(){
    int n;
    cin>>n;
    vector<ll> a(n),b(n),c(n);
    for(int i = 0;i<n;i++) cin>>a[i]>>b[i]>>c[i];
    vector<vector<vector<ll> > > dp(1<<n,vector<vector<ll> >(n,vector<ll>(3,0)));
    for(int i = 0;i<n;i++){
        dp[1<<i][i][0] = a[i];
        dp[1<<i][i][1] = b[i];
        dp[1<<i][i][2] = c[i];
    }
    
    ll ans = 0;
    for(int i = 0;i<1<<n;i++){
        for(int j = 0;j<n;j++){
            if(!(i>>j&1)) continue;
            ans = max(ans,dp[i][j][0]);
            ans = max(ans,dp[i][j][1]);
            ans = max(ans,dp[i][j][2]);
            for(int k = 0;k<n;k++){
                if(i>>k&1) continue;
                int a1,a2;
                for(int l = 0;l<3;l++){
                    if(l==0){
                        a1 = b[j];
                        a2 = c[j];
                    }else if(l==1){
                        a1 = a[j];
                        a2 = c[j];
                    }else{
                        a1 = a[j];
                        a2 = b[j];
                    }
                    int b1,b2;
                    ll h;
                    for(int L = 0;L<3;L++){
                        if(L==0){
                            h = a[k];
                            b1 = b[k];
                            b2 = c[k];
                        }else if(L==1){
                            b1 = a[k];
                            b2 = c[k];
                            h = b[k];
                        }else{
                            h = c[k];
                            b1 = a[k];
                            b2 = b[k];
                        }
                        if(ok(a1,a2,b1,b2)) chmax(dp[i|1<<k][k][L],dp[i][j][l]+h);
                    }
                }
            }
        }
    }
    cout<<ans<<endl;
}