#include <bits/stdc++.h>
using namespace std;

int main(){
    int W;
    cin >> W;
    vector<int64_t> A(W), B(W), C(W);
    for(int i=0; i<W; i++) cin >> A[i] >> B[i] >> C[i];

    auto calculate_cand = [&](int H, int offset){
        vector<pair<int64_t, int64_t>> res;
        for(int d=0; 2*d<=H; d++){
            vector<int> steps;
            for(int i=0; i<H-2*d; i++) steps.push_back(1);
            for(int i=0; i<d; i++) steps.push_back(2);
            do{
                int64_t money = 0, love = 0;
                int pt = offset;
                for(int s : steps){
                    if(s == 1){
                        money += A[pt];
                    }else{
                        money -= C[pt+1];
                        love += B[pt+1];
                    }
                    pt += s;
                }
                res.emplace_back(money, love);
            }while(next_permutation(steps.begin(), steps.end()));
        }
        sort(res.begin(), res.end());
        return res;
    };

    int H = W/2;
    int H2 = W-H;
    int64_t ans = 0;
    for(int k=0; k<2; k++){
        auto res1 = calculate_cand(H, 0);
        auto res2 = calculate_cand(H2, H);
        int sz = res2.size();
        int pt = sz-1;
        int64_t mx = -1e18;
        for(auto& p : res1){
            int64_t money = p.first, love = p.second;
            while(pt >= 0 && money + res2[pt].first >= 0){
                mx = max(mx, res2[pt].second);
                pt--;
            }
            ans = max(ans, love + mx);
        }
        H++;
        H2--;
    }
    cout << ans << endl;
    return 0;
}