#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef tuple<int, int, int> T;

int N;
int A[18], B[18], C[18];
vector<vector<T>> L;
int dp[1<<18][18][8];

signed main() {
    cin >> N;
    rep(i, N) cin >> A[i] >> B[i] >> C[i];
    rep(i, N) {
        vector<T> v;
        v.pb(make_tuple(A[i], B[i], C[i]));
        v.pb(make_tuple(A[i], C[i], B[i]));
        v.pb(make_tuple(B[i], A[i], C[i]));
        v.pb(make_tuple(B[i], C[i], A[i]));
        v.pb(make_tuple(C[i], A[i], B[i]));
        v.pb(make_tuple(C[i], B[i], A[i]));
        L.pb(v);
    }
    
    rep(i, N) rep(j, 6) dp[1<<i][i][j] = get<2>(L[i][j]);
    rep(S, 1<<N) {
        rep(i, N) {
            if (!((S>>i)&1)) continue;
            rep(j, N) {
                if ((S>>j)&1) continue;
                rep(k, 6) rep(l, 6) {
                    int pa = get<0>(L[i][k]), pb = get<1>(L[i][k]);
                    int a = get<0>(L[j][l]), b = get<1>(L[j][l]), c = get<2>(L[j][l]);
                    if (pa>=a && pb>=b) dp[S|(1<<j)][j][l] = max(dp[S|(1<<j)][j][l], dp[S][i][k]+c);
                }
            }
        }
    }
    
    int ans = 0;
    rep(S, 1<<N) rep(i, N) rep(j, 6) ans = max(ans, dp[S][i][j]);
    cout << ans << endl;
}