//AC解

#include <iostream>
#include <vector>
#include <algorithm>

int main(){
    int N;
    std::cin >> N;
    std::vector<int> A(N), B(N), C(N);
    for(int i = 0; i < N; ++i){
        std::cin >> A[i] >> B[i] >> C[i];
    }
    const int n = 3 * N;
    std::vector<int> a(n), b(n), c(n), p(n);
    for(int i = 0; i < N; ++i){
        if(A[i] > B[i]) a[i] = B[i], b[i] = A[i];
        else a[i] = A[i], b[i] = B[i];
        c[i] = C[i];
        if(C[i] > A[i]) a[i + N] = A[i], b[i + N] = C[i];
        else a[i + N] = C[i], b[i + N] = A[i];
        c[i + N] = B[i];
        if(B[i] > C[i]) a[i + 2 * N] = C[i], b[i + 2 * N] = B[i];
        else a[i + 2 * N] = B[i], b[i + 2 * N] = C[i];
        c[i + 2 * N] = A[i];
    }
    for(int i = 0; i < n; ++i) p[i] = i;
    sort(p.begin(), p.end(), [&](int i,int j){
        return a[i] == a[j] ?  b[i] < b[j] : a[i] < a[j];
    });
    std::vector<int> dp((1 << N) * n);
    for(int i : p){
        dp[i] = c[i];
    }
    int ans{0};
    for(int j = 0; j < (1 << N); ++j){
        const int J = j * n;
        for(auto i : p){
            if(j & (1 << (i % N))) continue;
            const int DP = dp[i + J];
            ans = std::max(ans, DP);
            const int v = j | (1 << (i % N));
            const int V = v * n;
            for(int k = 0; k < n; ++k){
                if(v & (1 << (k % N))) continue;
                if(a[i] > a[k] || b[i] > b[k]) continue;
                dp[k + V] = std::max(dp[k + V], DP + c[k]);
            }
        }
    }
    std::cout << ans << std::endl;
}