#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//ll inv(ll a, ll p) {
//	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
//}
//modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

void solve() {
	int n; cin >> n;
	vector<ll> a(n), b(n), c(n);
	rep(i, n) {
		cin >> a[i] >> b[i] >> c[i];
	}
	int d1 = n / 2; int d2 = n - d1;

	vector<LP> v;
	int goa;
	function<void(int, ll, ll)> dfs = [&](int id, ll bs, ll cs) {
		if (id == goa) {
			v.push_back({ cs,bs });
			return;
		}
		if (id + 2 <= goa) {
			dfs(id + 2, bs + b[id + 1], cs - c[id + 1]);
		}
		dfs(id + 1, bs, cs + a[id]);
	};
	goa = n;
	if (n <= 26) {
		dfs(0, 0, 0);
		ll ans = 0;
		rep(i, v.size()) {
			if (v[i].first >= 0) {
				ans = max(ans, v[i].second);
			}
		}
		cout << ans << endl; return;
	}
	dfs(d1, 0, 0);
	vector<LP> memo = v; v.clear();
	dfs(d1 + 1, 0, 0);
	vector<LP> memo2 = v; v.clear();
	sort(all(memo));
	for (int i = (int)memo.size() - 2; i >= 0; i--) {
		memo[i].second = max(memo[i].second, memo[i + 1].second);
	}
	sort(all(memo2));
	for (int i = (int)memo2.size() - 2; i >= 0; i--) {
		memo2[i].second = max(memo2[i].second, memo2[i + 1].second);
	}
	ll ans = 0;
	goa = d1;
	dfs(0, 0, 0);
	rep(i, v.size()) {
		int id = lower_bound(all(memo), LP{ -v[i].first ,-1 }) - memo.begin();
		if (id <memo.size()) {
			ans = max(ans, memo[id].second + v[i].second);
		}
	}
	v.clear();
	goa--;
	dfs(0, 0, 0);
	rep(i, v.size()) {
		v[i].first -= c[d1];
		v[i].second += b[d1];
		int id = lower_bound(all(memo2), LP{ -v[i].first ,-1 }) - memo2.begin();
		if (id <memo2.size()) {
			ans = max(ans, memo2[id].second + v[i].second);
		}
	}

	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(5);
	//init();
	//int t; cin >> t; rep(i, t)solve();
	//while (cin >> n, n)solve();
	solve();
	stop
		return 0;
}