#include<bits/stdc++.h>

int main(){
    using namespace std;
    unsigned long N;
    cin >> N;
    vector<pair<pair<unsigned long, unsigned long>, unsigned long>> r(N);
    for(auto&& i : r){
        vector v{0, 0, 0};
        cin >> v[0] >> v[1] >> v[2];
        sort(v.begin(), v.end());
        i.first.first = v[0];
        i.first.second = v[1];
        i.second = v[2];
    }
    unsigned long ans{0};
    vector<unordered_map<unsigned long, unsigned long>> dp(1UL << N);
    for(unsigned long i{0}; i < N; ++i){
        ans = max(ans, r[i].second);
        dp[1UL << i].emplace((r[i].first.first << 20) + r[i].first.second, r[i].second);
        dp[1UL << i].emplace((r[i].first.first << 20) + r[i].second, r[i].first.second);
        dp[1UL << i].emplace((r[i].first.second << 20) + r[i].second, r[i].first.first);
    }
    for(unsigned long j{1}; j < 1UL << N; ++j)for(const auto& [s, h] : dp[j])for(unsigned long i{0}; i < N; ++i)if(~(j >> i) & 1){
        unsigned long c{1UL << i};
        const auto& [x, y] = make_pair(s >> 20, s & 1048575);
        if(r[i].first.first > x || r[i].first.second > y)continue;
        dp[j | (1UL << i)][(r[i].first.first << 20) + r[i].first.second] = max(dp[j | (1UL << i)][(r[i].first.first << 20) + r[i].first.second], ans = max(ans, h + r[i].second));
        if(r[i].second > y)continue;
        dp[j | (1UL << i)][(r[i].first.first << 20) + r[i].second] = max(dp[j | (1UL << i)][(r[i].first.first << 20) + r[i].second], ans = max(ans, h + r[i].first.second));
        if(r[i].first.second <= y)dp[j | (1UL << i)][(r[i].first.second << 20) + r[i].second] = max(dp[j | (1UL << i)][(r[i].first.second << 20) + r[i].second], ans = max(ans, h + r[i].first.first));
    }
    cout << ans << endl;
    return 0;
}