#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int N;
    cin >> N;
    vector<vector<ll>> H(N, vector<ll>(3));
    auto dp = make_vec((1 << N), N, 3, 0LL);
    rep(i, N) { cin >> H[i][0] >> H[i][1] >> H[i][2]; }
    rep(i, N) {
        rep(j, 3) { dp[1 << i][i][j] = H[i][j]; }
    }
    for(int S = 1; S < (1 << N); S++) {
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < N; j++) {
                if(S & (1 << j))
                    continue;
                for(int k = 0; k < 3; k++) {
                    int s1 = H[i][(k + 1) % 3], t1 = H[i][(k + 2) % 3];
                    for(int l = 0; l < 3; l++) {
                        int s2 = H[j][(l + 1) % 3], t2 = H[j][(l + 2) % 3];
                        if(s1 > t1)
                            swap(s1, t1);
                        if(s2 > t2)
                            swap(s2, t2);
                        if(s2 <= s1 && t2 <= t1)
                            dp[S | (1 << j)][j][l] = max(dp[S | (1 << j)][j][l],
                                                         dp[S][i][k] + H[j][l]);
                    }
                }
            }
        }
    }
    ll res = 0;
    rep(i, N) rep(j, 3) res = max(res, dp[(1 << N) - 1][i][j]);
    cout << res << endl;
}