#include using namespace std; using int64 = long long; const int mod = 1e9 + 7; // const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } int main() { int N; cin >> N; auto A = make_v< int >(N, 3); cin >> A; for(auto &p : A) sort(begin(p), end(p)); auto dp = make_v< int >(1 << N, N, 10); fill_v(dp, -inf); for(int i = 0; i < (1 << N); i++) { for(int j = 0; j < N; j++) { if((~i >> j) & 1) continue; int k = 0; do { if(__builtin_popcount(i) == 1) chmax(dp[i][j][k], A[j][2]); for(int l = 0; k < N; k++) { if((i >> l) & 1) continue; int m = 0; do { if(A[j][0] <= A[l][0] && A[j][1] <= A[l][1]) { chmax(dp[i | (1 << l)][l][m], dp[i][j][k] + A[l][2]); } ++m; } while(next_permutation(begin(A[l]), end(A[l]))); } ++k; } while(next_permutation(begin(A[j]), end(A[j]))); } } int ret = 0; for(int i = 0; i < (1 << N); i++) { for(int j = 0; j < N; j++) { for(int k = 0; k < 10; k++) chmax(ret, dp[i][j][k]); } } cout << ret << endl; }