#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n;
    cin >> n;
    vector<array<int, 3>> A(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < 3; ++j) {
            cin >> A[i][j];
        }
    }
    auto dp = make_v(1 << n, n, 3, 0);
    auto dp0 = make_v(n, n, 3, 3, 0);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if(i == j) continue;
            for (int k = 0; k < 3; ++k) {
                for (int l = 0; l < 3; ++l) {
                    vector<int> tmp1, tmp2;
                    for (int m = 0; m < 3; ++m) {
                        if(k != m) tmp1.emplace_back(A[i][m]);
                        if(l != m) tmp2.emplace_back(A[j][m]);
                    }
                    if(tmp1[0] <= tmp2[0] && tmp1[1] <= tmp2[1]) chmax(dp0[i][j][k][l], A[j][l]);
                    if(tmp1[0] <= tmp2[1] && tmp1[1] <= tmp2[0]) chmax(dp0[i][j][k][l], A[j][l]);
                }
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < 3; ++j) {
            dp[1 << i][i][j] = A[i][j];
        }
    }
    int ans = 0;
    for (int i = 0; i < (1 << n); ++i) {
        for (int j = 0; j < n; ++j) {
            for (int k = 0; k < 3; ++k) {
                if(dp[i][j][k]){
                    chmax(ans, dp[i][j][k]);
                    for (int l = 0; l < n; ++l) {
                        if(!(i & (1 << l))){
                            for (int m = 0; m < 3; ++m) {
                                if(dp0[j][l][k][m]){
                                    chmax(dp[i^(1 << l)][l][m], dp[i][j][k]+dp0[j][l][k][m]);
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    cout << ans << "\n";
    return 0;
}