/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region SparseTable */

template <typename T> struct SparseTable {
    using F = function<T(T, T)>;
    vc<vc<T>> dat;
    vc<int> ht;
    const F f;

    SparseTable() {}
    SparseTable(F f) : f(f) {}

    void build(const vc<T> &v) {
        ll n = SIZE(v), h = 1;
        while ((1 << h) <= n) h++;
        dat.assign(h, vc<T>(n));
        ht.assign(n + 1, 0);
        REPM(j, 2, n) ht[j] = ht[j >> 1] + 1;

        REP(j, 0, n) dat[0][j] = v[j];
        for (int i = 1, p = 1; i < h; i++, p <<= 1)
            REP(j, 0, n) dat[i][j] = f(dat[i - 1][j], dat[i - 1][min(j + p, n - 1)]);
    };

    // 半開区間 [a, b) に対するクエリを実行する
    T query(int a, int b) {
        int l = b - a;
        return f(dat[ht[l]][a], dat[ht[l]][b - (1 << ht[l])]);
    }
};

/* #endregion */

// Problem
void solve() {
    VAR(ll, w);
    vll a(w), b(w), c(w);
    REP(i, 0, w) cin >> a[i] >> b[i] >> c[i];

    // イベント 0,1,2 を考える．
    //   - イベント 0 の直後にイベント 0, 1 は起きない（0 の次は必ず 2）．
    //   - イベント 1 で所持金 +a[i]
    //   - イベント 0 の直後のイベント 2 で所持金 -c[i], 好感度 +b[i]
    //   - イベント 1, 2 の直後のイベント 2 では何も起きない
    // 基本的には，イベント [0,2] のペアが繰り返す間にイベント 1 を 0 個以上挟み込んでいくことになる．
    ll sz2 = w / 2, sz1 = w - sz2;
    vc<pll> set1_rem0, set1_rem1, set2_rem0, set2_rem1;
    // dump(sz1, sz2);
    auto dfs1 = [&](auto &&dfs1, int pos, ll point, ll money) -> void {
        if (pos == sz1) {
            set1_rem0.emplace_back(money, point);
            return;
        }
        if (pos == sz1 - 1) {
            // 1 週しか余っていないとき，この 1 週は使わないで別扱いするか，イベント 1 に使う
            set1_rem1.emplace_back(money, point);
            dfs1(dfs1, pos + 1, point, money + a[pos]);
        } else {
            // 2 週以上余っているとき，イベント [0,1] かイベント 1 を選択
            dfs1(dfs1, pos + 2, point + b[pos + 1], money - c[pos + 1]);
            dfs1(dfs1, pos + 1, point, money + a[pos]);
        }
    };
    dfs1(dfs1, 0, 0, 0);
    sort(ALL(set1_rem0));
    sort(ALL(set1_rem1));
    // dump(set1_rem0);
    // dump(set1_rem1);

    auto dfs2 = [&](auto &&dfs2, int pos, ll point, ll money, int offset) -> void {
        if (pos == w) {
            if (offset == sz1)
                set2_rem0.emplace_back(money, point);
            else
                set2_rem1.emplace_back(money, point);
            return;
        }
        if (pos == w - 1) {
            // 1 週しか余っていないとき，イベント 1 に使う
            dfs2(dfs2, pos + 1, point, money + a[pos], offset);
        } else {
            // 2 週以上余っているとき，イベント [0,1] かイベント 1 を選択
            dfs2(dfs2, pos + 2, point + b[pos + 1], money - c[pos + 1], offset);
            dfs2(dfs2, pos + 1, point, money + a[pos], offset);
        }
    };
    dfs2(dfs2, sz1, 0, 0, sz1);
    dfs2(dfs2, sz1 - 1, 0, 0, sz1 - 1);
    sort(ALL(set2_rem0));
    sort(ALL(set2_rem1));
    // dump(set2_rem0);
    // dump(set2_rem1);

    auto f = [](pll a, pll b) -> pll {
        if (a.second > b.second)
            return a;
        else
            return b;
    };
    SparseTable<pll> tbl2_0(f), tbl2_1(f);
    tbl2_0.build(set2_rem0);
    tbl2_1.build(set2_rem1);

    ll ma = 0;
    // set1_rem0
    for (auto [money, point] : set1_rem0) {
        // set2_rem0 から探す
        pll needle = {-money, -INF};
        auto it = lower_bound(ALL(set2_rem0), needle);
        if (it != set2_rem0.end()) {
            int idx = it - set2_rem0.begin(); //
            pll r = tbl2_0.query(idx, SIZE(set2_rem0));
            chmax(ma, point + r.second);
        }
    }
    // set1_rem1
    for (auto [money, point] : set1_rem1) {
        // set2_rem0 から探す
        pll needle = {-money, -INF};
        auto it = lower_bound(ALL(set2_rem1), needle);
        if (it != set2_rem1.end()) {
            int idx = it - set2_rem1.begin(); //
            pll r = tbl2_1.query(idx, SIZE(set2_rem1));
            chmax(ma, point + r.second);
        }
    }
    pprint(ma);
}

// entry point
int main() {
    solve();
    return 0;
}