//
// Created by yamunaku on 2020/01/17.
//

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

int main(){
    // CFS;
    int n;
    cin >> n;
    vl a(n), b(n), c(n);
    rep(i, n) cin >> a[i] >> b[i] >> c[i];
    map<ll, ll> mp1, mp2;
    mp1[0] = LINF;
    rep(i, n){
        map<ll, ll> mp;
        for(auto &p:mp1){
            mp[p.first] = max(mp[p.first], p.second + a[i]);
        }
        for(auto &p:mp2){
            mp[p.first + b[i]] = max(mp[p.first + b[i]], p.second - c[i]);
        }
        mp2 = mp1;
        mp1 = mp;
    }
    ll ans = 0;
    for(auto &p:mp1){
        if(p.second >= LINF) ans = max(ans, p.first);
    }
    cout << ans << endl;
    return 0;
}