#include <algorithm>
// #include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    vector<ll> B(N);
    vector<ll> C(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i] >> B[i] >> C[i];
    }
    vector<vector<ll>> h(N, vector<ll>(3));
    for (ll i = 0; i < N; i++) {
        h[i][0] = A[i];
        h[i][1] = B[i];
        h[i][2] = C[i];
    }

    ll INF = 100000000000023;
    // 既に選んだ集合が i で，最も上が j，高さとして選んだものが k 番目の辺
    vector<vector<vector<ll>>> bitdp(
        1 << N, vector<vector<ll>>(N + 1, vector<ll>(3, -INF)));
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < 3; j++) {
            bitdp[1 << i][i][j] = h[i][j];
        }
    }
    for (ll i = 1; i < (1 << N); i++) {
        for (ll j = 0; j < N; j++) {
            for (ll k = 0; k < N; k++) {
                if ((i >> k) & 1) {
                    continue;
                }
                for (ll l = 0; l < 3; l++) {
                    for (ll m = 0; m < 3; m++) {
                        ll prev_tate = INF;
                        ll prev_yoko = -INF;
                        ll next_tate = INF;
                        ll next_yoko = -INF;
                        for (ll n = 0; n < 3; n++) {
                            if (l == n) {
                                continue;
                            }
                            prev_tate = min(prev_tate, h[j][n]);
                            prev_yoko = max(prev_yoko, h[j][n]);
                        }
                        for (ll n = 0; n < 3; n++) {
                            if (m == n) {
                                continue;
                            }
                            next_tate = min(next_tate, h[k][m]);
                            next_yoko = max(next_yoko, h[k][m]);
                        }
                        if (next_tate <= prev_tate && next_yoko <= prev_yoko) {
                            bitdp[i + (1 << k)][k][m] =
                                max(bitdp[i + (1 << k)][k][m],
                                    bitdp[i][j][l] + h[k][m]);
                        }
                    }
                }
            }
        }
    }
    ll ans = 0;
    for (ll i = 0; i < (1 << N); i++) {
        for (ll j = 0; j < N; j++) {
            for (ll k = 0; k < 3; k++) {
                ans = max(ans, bitdp[i][j][k]);
            }
        }
    }
    cout << ans << endl;
}