#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;

using pint = pair<int, int>;
int main()
{
    int N;
    cin >> N;
    vector<pint> xy(N * 3);
    vector<int> z(N * 3);
    int j = 0;
    for (int i = 0; i < N; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        for (int d = 0; d < 3; d++)
        {
            z[j] = a, xy[j] = make_pair(min(b, c), max(b, c));
            swap(a, b), swap(b, c), j++;
        }
    }
    xy.emplace_back(1e8, 1e8);
    vector<vector<int>> dp(N * 3 + 1, vector<int>(1 << N));
    for (int S = 0; S < (1 << N); S++)
    {
        for (int i = 0; i < N * 3 + 1; i++)
        {
            for (int j = 0; j < N * 3; j++) if (!((S >> (j / 3)) & 1))
            {
                if (xy[i].first < xy[j].first) continue;
                if (xy[i].second < xy[j].second) continue;
                dp[j][S + (1 << (j / 3))] = max(dp[j][S + (1 << (j / 3))], dp[i][S] + z[j]);
            }
        }
    }
    int ret = 0;
    for (auto &vec : dp) ret = max(ret, *max_element(vec.begin(), vec.end()));
    cout << ret << '\n';
}