#include #include #include #include #include #include template inline bool chmin(T &lhs, const U &rhs) { if (lhs > rhs) { lhs = rhs; return true; } return false; } template inline bool chmax(T &lhs, const U &rhs) { if (lhs < rhs) { lhs = rhs; return true; } return false; } // [l, r) from l to r struct range { struct itr { int i; constexpr itr(int i_): i(i_) { } constexpr void operator ++ () { ++i; } constexpr int operator * () const { return i; } constexpr bool operator != (itr x) const { return i != x.i; } }; const itr l, r; constexpr range(int l_, int r_): l(l_), r(std::max(l_, r_)) { } constexpr itr begin() const { return l; } constexpr itr end() const { return r; } }; // [l, r) from r to l struct revrange { struct itr { int i; constexpr itr(int i_): i(i_) { } constexpr void operator ++ () { --i; } constexpr int operator * () const { return i; } constexpr bool operator != (itr x) const { return i != x.i; } }; const itr l, r; constexpr revrange(int l_, int r_): l(l_ - 1), r(std::max(l_, r_) - 1) { } constexpr itr begin() const { return r; } constexpr itr end() const { return l; } }; constexpr int inf = (1 << 30) - 1; int main() { int N; std::cin >> N; std::vector> base(N); for (auto &arr: base) { arr = {}; for (auto &x: arr) { std::cin >> x; } std::sort(arr.rbegin(), arr.rend()); } long long ans = 0; for (int set: range(0, 1 << N)) { std::vector> vec; for (int i: range(0, N)) { if (set >> i & 1) { vec.push_back({ base[i][1], base[i][2], base[i][0], i }); vec.push_back({ base[i][1], base[i][0], base[i][2], i }); } else { vec.push_back({ base[i][0], base[i][1], base[i][2], i }); vec.push_back({ base[i][0], base[i][2], base[i][1], i }); } } vec.push_back({ inf, inf, inf, -1 }); std::sort(vec.rbegin(), vec.rend()); std::vector dp(vec.size()); for (int i: range(1, vec.size())) { for (int j: range(0, i)) { if (vec[j][0] >= vec[i][0] && vec[j][1] >= vec[i][1] && vec[j][3] != vec[i][3]) { chmax(dp[i], dp[j] + vec[i][2]); } } } chmax(ans, *std::max_element(dp.cbegin(), dp.cend())); } std::cout << ans << '\n'; return 0; }