#include "bits/stdc++.h"

using namespace std;

using i64 = long long;


signed main(){
    int n;
    cin >> n;
    vector<i64> a(n), b(n), c(n);
    for(int i = 0; i < n; ++i)
        cin >> a[i] >> b[i] >> c[i];

    array<int, 2> m{n / 2, (n + 1) / 2};


    // v[k][flag] = (money, val)
    vector<vector<pair<i64,i64>>> v(2);
    vector<vector<pair<i64,i64>>> special(2);

    for(int k = 0; k < 2; ++k){
        for(int i = 0; i < (1 << m[k]); ++i){
            i64 money = 0;
            i64 val = 0;
            bool flag = false;
            bool ignore = false;
            for(int j = 0; j < m[k]; ++j){
                if((i >> j) & 1){
                    if(flag){
                        ignore = true;
                        break;
                    }
                    flag = true;
                }
                else{
                    if(flag){
                        val += b[j + m[0] * k];
                        money -= c[j + m[0] * k];
                    }
                    else{
                        money += a[j + m[0] * k];
                    }
                    flag = false;
                }
            }
            if(!ignore){
                v[k].emplace_back(money, val);
                if(!k && flag)
                    special[k].emplace_back(money, val);
                if(k && !(i & 1))
                    special[k].emplace_back(money - a[m[0]] - c[m[0]], val + b[m[0]]);
            }
        }
    }

    sort(v[1].begin(),v[1].end());
	sort(special[1].begin(),special[1].end());
	
	long long last = 0;
	for(auto it = v[1].rbegin();it!=v[1].rend();it++){
		last = max(last,(*it).second);
		(*it).second = last;
	}
	
	last=0;
	for(auto it = special[1].rbegin();it!=special[1].rend();it++){
		last = max(last,(*it).second);
		(*it).second = last;
	}

	pair<long long,long long> P = make_pair(0,-100000000000000000);
	
    i64 ans = 0;
    for(int i = 0; i < v[0].size(); ++i){
		P.first = -v[0][i].first;
        auto it = lower_bound(v[1].begin(), v[1].end(), P);
        if(it == v[1].end()){
            continue;
        }
        int idx = distance(v[1].begin(), it);
        ans = max(ans, v[0][i].second + v[1][idx].second);
    }

     for(int i = 0; i < special[0].size(); ++i){
		P.first = -special[0][i].first;
        auto it = lower_bound(special[1].begin(), special[1].end(), P);
        if(it == special[1].end()){
            continue;
        }
        int idx = distance(special[1].begin(), it);
        ans = max(ans, special[0][i].second + special[1][idx].second);
    }

    /*
    for(int i = 0; i < 2; ++i){
        for(auto &x : v_keys[i])
            cout << x << " ";
        cout << endl;
        for(auto &x : v_vals[i])
            cout << x << " ";
        cout << endl;
        cout << endl;
    }
     */

    cout << ans << endl;
}