#include <bits/stdc++.h>
using namespace std;

#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
//constexpr long long MOD = 998244353LL;
typedef vector<ll> Array;
typedef vector<Array> Matrix;


template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge {
	ll to, cap, rev;
	Edge(ll _to, ll _cap, ll _rev) {
	to = _to; cap = _cap; rev = _rev;
	}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;

void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
	G[from].push_back(Edge(to, cap, (ll)G[to].size()));
	if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}

void solve(){
    ll n;
    cin>>n;
    vvec<ll> abc(n);
    REP(i,n) {
        ll a,b,c;
        cin>>a>>b>>c;
        abc[i]={a,b,c};
    }
    sort(all(abc));

    vvec<vec<ll>> dp(1LL<<n,vvec<ll>(n ,vec<ll>(3,0)));
    ll ans=0;

    REP(bit,1LL<<n){
        REP(i,n){
            if(bit>>i&1) continue;
            REP(j,n){
                REP(k,3){
                    REP(l,3){
                        vec<ll> pre,now;
                        REP(ii,3){
                            if(ii!=k) pre.push_back(abc[j][ii]);
                            if(ii!=l) now.push_back(abc[i][ii]);
                        }
                        
                        sort(all(pre));
                        sort(all(now));
                        if(pre[0]>now[0] || pre[1]>now[1]) continue;
                        chmax(dp[bit+(1LL<<i)][i][l], dp[i][j][k]+abc[i][l]);
                        chmax(ans,dp[i][j][k]+abc[i][l]);
                        
                    }
                }
            }
        }
    }
    cout<<ans<<en;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    solve();
    //ll t;cin>>t;REP(i,t) solve();

    return 0;
}