#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
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(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int dp[1<<16][100];
vector<pii> z;

int main(){
    int n;
    scanf("%d", &n);
    int a[n][3];
    rep(i, n){
        rep(j, 3) scanf("%d", &a[i][j]);
        int id[3] = {0, 1, 2};
        do{
            z.emplace_back(a[i][id[0]], a[i][id[1]]);
        }while(next_permutation(id, id+3));
    }
    z.emplace_back(mod, mod);
    sort(z.begin(), z.end());
    int m = z.size();
    z.erase(unique(z.begin(), z.end()), z.end());

    rep(S, 1<<n)rep(t, m) dp[S][t] = -1;
    dp[0][m-1] = 0;
    rep(S, 1<<n)rep(t, m)if(dp[S][t] >= 0){
        rep(i, n)if(!(S>>i & 1)){
            int id[3] = {0, 1, 2};
            do{
                int p = lower_bound(z.begin(), z.end(), make_pair(a[i][id[0]], a[i][id[1]])) - z.begin();
                if(z[t].fi >= a[i][id[0]] && z[t].se >= a[i][id[1]]){
                    chmax(dp[S | (1<<i)][p], dp[S][t] + a[i][id[2]]);
                }
            }while(next_permutation(id, id+3));
        }
    }
    int ans = 0;
    rep(S, 1<<n)rep(t, m) chmax(ans, dp[S][t]);
    printf("%d\n", ans);
}