#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n;
ll a[60],b[60],c[60];
ll sum;
vector<pair<ll,ll>>V;
vector<int>mask[30];
ll ans;

void solve(){
	if(V.size() <= 10){
		for(int k=0;k<mask[V.size()].size();k++){
			ll gen = 0, gain = 0;
			rep(i,V.size()){
				int M = mask[V.size()][k];
				if(((M>>i)&1)){
					gen += V[i].fi;
					gain += V[i].sc;
				}
			}
			if(sum >= gen) ans = max(ans,gain);
		}
		cout << ans << endl;
		return ;
	}
	int nn = V.size()/2;
	int mm = V.size()-nn;
	vector<pair<ll,ll>>pr[2];
	rep(k,mask[nn].size()){
		ll genn = 0, gainn = 0;
		int f = 0;
		rep(i,nn){
			int M = mask[nn][k];
			if(((M>>i)&1)){
				if(i == nn-1) f = 1;
				genn += V[i].fi;
				gainn += V[i].sc;
			}
		}
		pr[f].pb(mp(genn,gainn));
	}
	rep(f,2) SORT(pr[f]);
	rep(f,2) for(int i=1;i<pr[f].size();i++) pr[f][i].sc = max(pr[f][i].sc,pr[f][i-1].sc);
	rep(k,mask[mm].size()){
		ll genn = 0, gainn = 0;
		int f = 0;
		rep(i,mm){
			int M = mask[mm][k];
			if(((M>>i)&1)){
				if(i == 0) f = 1;
				genn += V[nn+i].fi;
				gainn += V[nn+i].sc;
			}
		}
		int pt = POSL(pr[0],mp(sum-genn+1,(ll)-1e18));
		pt--;
		if(pt >= 0) ans = max(ans,pr[0][pt].sc+gainn);
		if(!f){
			int pt = POSL(pr[1],mp(sum-genn+1,(ll)-1e18));
			pt--;
			if(pt >= 0) ans = max(ans,pr[1][pt].sc+gainn);
		}
	}
	cout << ans << endl;
}
int main(){
	mask[0].pb(0);
	mask[1].pb(0); mask[1].pb(1);
	for(int i=2;i<=26;i++){
		for(int j=0;j<mask[i-1].size();j++){
			int cur = mask[i-1][j];
			mask[i].pb(cur);
			if(cur >= (1<<(i-2))){
				continue;
			}
			else mask[i].pb(mask[i-1][j] | (1<<(i-1)));
		}
		SORT(mask[i]); ERASE(mask[i]);
	}
	scanf("%d",&n);
	repn(i,n) scanf("%lld%lld%lld",&a[i],&b[i],&c[i]);
	repn(i,n) sum += a[i];
	for(int i=2;i<=n;i++){
		ll N = a[i-1]+a[i]+c[i];
		ll G = b[i];
		V.pb(mp(N,G));
	}
	solve();
}