#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<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
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 Per(i,sta,n) for(int i=n-1;i>=sta;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++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

int n;
ll a[55],b[55],c[55];

void rec(int s,int finish,map<ll,ll> &ma,ll money,ll love){
  //cout << s  << endl;
  if(s==finish){
    ma[money]=max(ma[money],love);
    return;
  }
  rec(s+1,finish,ma,money+a[s],love);
  if(s+2<=finish) rec(s+2,finish,ma,money-c[s+1],love+b[s+1]);
}

ll solve(int mid){
  map<ll,ll> former,latter;
  former.clear();
  latter.clear();
  rec(0,mid,former,0,0);
  rec(mid,n,latter,0,0);
  latter[-INF]=-INF;
  auto id=latter.end();id--;
  map<ll,ll> max_latter;
  max_latter.clear();
  ll L=-INF;
  while(true){
    ll money=(*id).first,love=(*id).second;
    //cout << money << " " << love << endl;
    L=max(L,love);
    max_latter[money]=L;
    if(id==latter.begin()) break;
    id--;
  }
  id=max_latter.end();id--;
  ll M=(*id).first;
  ll ans=0;
  for(auto p:former){
    ll money=p.first,love=p.second;
    while(M+money>=0){
      id--;
      M=(*id).first;L=(*id).second;
      if(M+money<0){
        id++;
        M=(*id).first;L=(*id).second;
        break;
      }
    }
    if(M+money>=0)ans=max(ans,L+love);
  }
  return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    cin >> n;
    rep(i,n){
      cin >> a[i] >> b[i] >> c[i];
    }
    cout << max(solve(n/2),solve(n/2+1)) << endl;
}