#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin, n;
    vector<vector<ll>> v(n);
    rep(i, 0, n) {
        int a, b, c;
        cin, a, b, c;
        v[i] = {a, b, c};
    }

    const int bits = 1 << n;
    auto dp = make_v(bits, n, 3, 0LL);
    ll ans = 0;

    rep(i, 0, n) {
        rep(j, 0, 3) {
            dp[1 << i][i][j] = v[i][j];
            chmax(ans, v[i][j]);
        }
    }

    rep(bit, 1, bits) {
        rep(i, 0, n) {
            if (!((bit >> i) & 1)) continue;
            rep(j, 0, 3) {
                vector<int> box;
                rep(t, 0, 3) {
                    if (t != j) box.push_back(v[i][t]);
                }
                if (box[0] > box[1]) swap(box[0], box[1]);
                rep(k, 0, n) {
                    if ((bit >> k) & 1) continue;
                    rep(l, 0, 3) {
                        vector<int> nbox;
                        rep(t, 0, 3) {
                            if (t != l) nbox.push_back(v[k][t]);
                        }
                        if (nbox[0] > nbox[1]) swap(nbox[0], nbox[1]);
                        if (nbox[0] <= box[0] && nbox[1] <= box[1]) {
                            chmax(dp[bit | (1 << k)][k][l], dp[bit][i][j] + v[k][l]);
                            chmax(ans, dp[bit | (1 << k)][k][l]);
                        }
                    }
                }
            }
        }
    }
    print(ans);

    return 0;
}