#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;

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

mat l(17, vec(3)), dp((1LL<<16), vec(16 * 3 + 1, -1));

ll solve(int s, int men){
    if(men != -1) {
        if(dp[s][men] != -1) return dp[s][men];
    }
    ll lastv = men / 3;
    ll l1 = l[lastv][men%3], l2 = l[lastv][(men + 1)%3];
    if(l1 > l2) swap(l1, l2);
    ll res = 0;
    rep(i,N){
        if((s>>i)&1){
            rep(j,3){
                int r1 = l[i][j], r2 = l[i][(j+1)%3];
                if(r1 > r2) swap(r1, r2);
                if(r1 <= l1 && r2 <= l2){
                    chmax(res, solve(s ^ (1LL<<i), i * 3 + j) + l[i][(j+2)%3]);
                }
            }
        }
    }
    if(men != -1) dp[s][men] = res;
    return res;
}

int main() {
    cin>>N;
    rep(i,N) rep(j,3) cin>>l[i][j];
    l[16][0] = l[16][1] = int(1e+9);
    cout<<solve((1LL<<N) - 1, 16 * 3)<<endl;
}