//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  if (a < b) {
    return b - a;
  } else {
    return a - b;
  }
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a) {
    a = b;
  }
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b) {
    a = b;
  }
}
template <class F> class fix_point : private F {
public:
  explicit constexpr fix_point(F &&f) : F(std::forward<F>(f)) {}

  template <class... Args>
  constexpr decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};
template <class F> constexpr decltype(auto) make_fix(F &&f) {
  return fix_point<F>(std::forward<F>(f));
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <algorithm>
#include <cmath>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>

namespace n91 {

void main_() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  struct day_t {
    i64 a;
    u64 b;
    i64 c;
  };
  std::vector<day_t> ds(n);
  for (auto &e : ds) {
    std::cin >> e.a >> e.b >> e.c;
  }
  const usize h = n / 2;
  struct node {
    i64 co;
    i64 pt;

    constexpr bool operator<(const node &r) const noexcept { return co < r.co; }
  };
  const double sq5 = std::sqrt(static_cast<double>(5));
  std::vector<node> ff, fd;
  {
    const usize lim = std::pow((1 + sq5) / 2, h + 1) / sq5;
    std::vector<node> buf;
    ff.reserve(lim);
    fd.reserve(lim);
    buf.reserve(lim);
    ff.push_back({0, 0});
    for (const usize i : rep(0, h)) {
      const auto &d = ds[i];
      for (auto &e : ff) {
        e.co += d.a;
      }
      for (auto &e : fd) {
        e.co -= d.c;
        e.pt += d.b;
      }
      std::merge(ff.cbegin(), ff.cend(), fd.cbegin(), fd.cend(),
                 std::back_inserter(buf));
      for (auto &e : ff) {
        e.co -= d.a;
      }
      std::swap(ff, buf);
      std::swap(fd, buf);
      buf.clear();
    }
  }
  std::vector<node> bf, bd;
  {
    const usize lim = std::pow((1 + sq5) / 2, n - h + 1) / sq5;
    std::vector<node> buf;
    bf.reserve(lim);
    bd.reserve(lim);
    buf.reserve(lim);
    bf.push_back({0, 0});
    for (const usize i : revrep(h, n)) {
      const auto &d = ds[i];
      for (auto &e : bf) {
        e.co += d.a;
      }
      std::merge(bf.cbegin(), bf.cend(), bd.cbegin(), bd.cend(),
                 std::back_inserter(buf));
      for (auto &e : bf) {
        e.co -= d.a + d.c;
        e.pt += d.b;
      }
      std::swap(bf, buf);
      std::swap(bd, buf);
      buf.clear();
    }
  }

  i64 ans = 0;
  {
    std::reverse(bf.begin(), bf.end());
    i64 pm = std::numeric_limits<i64>::lowest();
    auto itr = bf.cbegin();
    const auto end = bf.cend();
    for (const auto &e : ff) {
      while (itr != end && itr->co + e.co >= 0) {
        chmax(pm, itr->pt);
        itr += 1;
      }
      chmax(ans, pm + e.pt);
    }
  }
  {
    std::reverse(bd.begin(), bd.end());
    i64 pm = std::numeric_limits<i64>::lowest();
    auto itr = bd.cbegin();
    const auto end = bd.cend();
    for (const auto &e : fd) {
      while (itr != end && itr->co + e.co >= 0) {
        chmax(pm, itr->pt);
        itr += 1;
      }
      chmax(ans, pm + e.pt);
    }
  }
  std::cout << ans << "\n";
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}