#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n;
    cin >> n;
    vector<ll> r(n), a(n), w(n), t(n);
    REP(i, n) {
        cin >> r[i] >> a[i] >> w[i] >> t[i];
        if(a[i]<=0 && w[i]<=0) {
            i--;
            n--;
        }
    }
    vector<ll> ord(n);
    iota(ALL(ord), 0);
    sort(ALL(ord), [&](ll x, ll y){
        return t[x]+r[x] < t[y]+r[y];
    });

    vector<vector<ll>> dp(5001, vector<ll>(2, -LLINF));
    dp[0][0] = 0;
    for(auto i: ord) {
        FOR(j, r[i], r[i]+t[i]) chmax(dp[j][1], dp[j-r[i]][0]+a[i]);
        FOR(j, r[i], r[i]+t[i]) chmax(dp[j][1], dp[j-r[i]][1]+w[i]);
        REP(j, 5001) {
            chmax(dp[j][0], dp[j][1]);
            dp[j][1] = -LLINF;
        }
    }

    // vector<vector<vector<ll>>> dp(n+1, vector<vector<ll>>(5001, vector<ll>(2)));
    // REP(i, n) REP(j, 2001) dp[i][j][0] = dp[i][j][1] = -LLINF;
    // dp[0][0][0] = 0;
    // REP(ii, n) {
    //     ll i = ord[ii];
    //     FOR(j, r[i], r[i]+t[i]) {
    //         chmax(dp[ii+1][j][1], dp[ii][j-r[i]][0]+a[i]);
    //         chmax(dp[ii+1][j][1], dp[ii+1][j-r[i]][1]+w[i]);
    //     }
    //     REP(j, 5001) {
    //         chmax(dp[ii+1][j][0], dp[ii][j][0]);
    //         chmax(dp[ii+1][j][0], dp[ii+1][j][1]);
    //     }
    // }

    // REP(i, n+1) {
    //     cout << "i=" << ord[i] << endl;
    //     REP(j, 21) cout << j << " " << dp[i][j][0] << " " << dp[i][j][1] << endl;
    //     cout << endl;
    // }

    ll ret = 0;
    REP(i, 5001) chmax(ret, dp[i][0]);
    cout << ret << endl;

    return 0;
}



Measured memory_bytes: 3348