#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int NN, NL, NR;
ll A[MAX_N], B[MAX_N], C[MAX_N];
vi vx;

void loop(int at, int one, int bit, int n) {
	if(at == n) {
		vx.pb(bit);
		return;
	}
	if(one) {
		loop(at + 1, 0, bit | (1 << at), n);
	}
	else {
		rep(i, at + 1, n + 1) {
			loop(i, 1, bit, n);
		}
	}
}
int dp[MAX_N][2];

void solve() {
	cin >> NN;
	rep(i, 0, NN) cin >> A[i] >> B[i] >> C[i];
	NL = (NN + 1) / 2; NR = NN - NL;
	vx.clear();
	vi vxl, vxr;
	loop(0, 0, 0, NL + 1);
	vxl = vx;
	vx.clear();
	loop(0, 0, 0, NR);
	loop(0, 1, 0, NR);
	vxr = vx;

	vector<pl> D, E;

	rep(i, 0, sz(vxl)) {
		int bit = vxl[i];
		ll a = 0, b = 0;
		rep(i, 0, NL) {
			if(!(bit & (1 << i)) && !(bit & (1 << (i + 1)))) {
				a += A[i];
			}
			if(bit & (1 << i)) {
				a -= C[i];
				b += B[i];
			}
		}
		if(bit & (1 << NL)) D.pb(pl(a, b));
		else E.pb(pl(a, b));
	}
	D.pb(pl(linf, -linf));
	E.pb(pl(linf, -linf));
	sort(all(D));
	sort(all(E));
	rer(i, sz(D), 1) MAX(D[i - 1].sec, D[i].sec);
	rer(i, sz(E), 1) MAX(E[i - 1].sec, E[i].sec);
	// debug(D, E);

	ll res = 0;
	rep(i, 0, sz(vxr)) {
		int bit = vxr[i];
		ll a = 0, b = 0;
		rep(i, 0, NR) {
			if(!(bit & (1 << i)) && !(bit & (1 << (i + 1)))) {
				a += A[i + NL];
			}
			else if(bit & (1 << i)) {
				a -= C[i + NL];
				b += B[i + NL];
			}
		}
		if(bit & 1) {
			pl p = *lower_bound(all(D), pl(a * -1, -linf));
			MAX(res, b + p.sec);
		}
		else {
			pl p = *lower_bound(all(E), pl(a * -1, -linf));
			MAX(res, b + p.sec);
		}
	}
	cout << res << "\n";
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}