#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const long long INF = 1LL << 61;
int main() {
  int W;
  cin >> W;
  vector<long long> a(W), b(W), c(W);
  for (int i = 0; i < W; i++) {
    cin >> a[i] >> b[i] >> c[i];
  }
  if (W == 1) {
    cout << 0 << endl;
  } else {
    vector<pair<long long, long long>> A;
    auto dfs = [&] (auto dfs, int l, int r, long long M, long long L) -> void {
      if (l == r) {
        A.push_back(make_pair(M, L));
        return;
      }
      dfs(dfs, l + 1, r, M + a[l], L);
      if (l + 2 <= r) {
        dfs(dfs, l + 2, r, M - c[l + 1], L + b[l + 1]);
      }
    };
    long long ans = 0;
    for (int mid : {W / 2, W / 2 - 1}) {
      dfs(dfs, 0, mid, 0LL, 0LL);
      vector<pair<long long, long long>> B = A;
      int N = B.size();
      sort(B.rbegin(), B.rend());
      long long MAXB = -INF;
      for (int i = 0; i < N; i++) {
        B[i].second = max(B[i].second, MAXB);
        MAXB = max(MAXB, B[i].second);
      }
      sort(B.begin(), B.end());
      A.clear();
      dfs(dfs, mid, W, 0LL, 0LL);
      B.push_back(make_pair(INF, -INF));
      N = A.size();
      for (int i = 0; i < N; i++) {
        auto itr = lower_bound(B.begin(), B.end(), make_pair(-A[i].first, 0LL));
        ans = max(ans, itr->second + A[i].second);
      }
      A.clear();
    }
    cout << ans << endl;
  }
}