#include "bits/stdc++.h"

using namespace std;

using i64 = long long;

const i64 MOD = 1000000007;

int n;
vector<i64> a, b, c, r, m;
i64 ans;

i64 greedy(int l){
    i64 money = 0, ret = 0;
    for(int i = l; i < n; ++i){
        if(i != n - 1 && money >= c[i + 1]){
            money -= c[i + 1];
            ret += b[i + 1];
            ++i;
        }
        else{
            money += a[i];
        }
    }
    for(int i = 0; i < l - 1; ++i){
        if(money >= c[i + 1]){
            money -= c[i + 1];
            ret += b[i + 1];
            ++i;
        }
        else{
            money += a[i];
        }
    }
    return ret;
}

i64 greedy_inv(int s){
    i64 money = 0, ret = 0;
    for(int i = s; i >= 0; --i){
        if(i && money >= c[i]){
            money -= c[i];
            money -= a[i];
            ret += b[i];
            --i;
        }
        else{
            money += a[i];
        }
    }
    for(int i = n - 1; i > s + 1; --i){
        if(i != s && money >= c[i]){
            money -= c[i];
            money -= a[i];
            ret += b[i];
            --i;
        }
        else{
            money += a[i];
        }
    }
    return ret;
}

// [i, n)
bool cond(int i, i64 money, i64 val){
    if(val + r[i] < ans)
        return false;
    if(money + m[i] < 0)
        return false;
    return true;
}

void dfs(int i, i64 money, i64 val){
    if(i == n){
        if(money >= 0)
            ans = max(ans, val);
        return;
    }
    if(!cond(i, money, val))
        return;
    if(i != n - 1)
        dfs(i + 2, money - c[i + 1], val + b[i + 1]);
    dfs(i + 1, money + a[i], val);
}

signed main(){
    cin >> n;
    a.resize(n);
    b.resize(n);
    c.resize(n);
    for(int i = 0; i < n; ++i)
        cin >> a[i] >> b[i] >> c[i];
    a.emplace_back(0);
    b.emplace_back(0);
    c.emplace_back(0);
    a.emplace_back(0);
    b.emplace_back(0);
    c.emplace_back(0);
    r.resize(n + 1, 0);
    m.resize(n + 1, 0);
    for(int i = n - 2; i >= 0; --i)
        r[i] = max({r[i], r[i + 1], r[i + 2] + b[i + 1]});
    for(int i = n - 1; i >= 0; --i)
        m[i] = m[i + 1] + a[i];

    ans = 0;
    for(int i = 0; i < n; ++i)
        ans = max(ans, greedy(i));
    for(int i = 0; i < n; ++i)
        ans = max(ans, greedy_inv(i));

    dfs(0, 0, 0);

    cout << ans << endl;
}