/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll W;
    cin >> W;
    ll a[55], b[55], c[55];
    rep(i,0,W) cin >> a[i] >> b[i] >> c[i];
    ll ans = 0;
    rep(bit,0,(1LL<<W)){
         vector<ll> v;
         rep(i,0,W) v.push_back((bit>>i) & 1);
         v.push_back(0);
         bool ok = true;
         if(v[0] == 1) ok = false;
         rep(i,1,W){
             if(v[i] == 1 && v[i-1] == 1) ok = false;
         }
         if(not ok) continue;
         ll res = 0;
         ll money = 0;
         rep(i,0,W){
             if(v[i] == 1){
                 res += b[i];
                 money -= c[i];
             }else if(v[i+1] == 0){
                 money += a[i];
             }
         }
         if(money >= 0){
             ans = max(ans, res);
         }
    }
    print(ans);

}