#include <cstdio>
#include <vector>
#include <algorithm>

int w;
long long int A[100], B[100], C[100];

struct S {
  long long int money;
  long long int love;
};

std::vector<S> states0, states1, tmp;

int main(){
  scanf("%d", &w);
  for(int i = 0; i < w; i++) scanf("%lld%lld%lld", A+i, B+i, C+i);

  states0.emplace_back(S({0, 0}));
  for(int i = 0; i < w; i++){
    for(auto it0 = states0.begin(), it1 = states1.begin(); ;){
      if(it0 == states0.end()){ for(; it1 != states1.end(); ++it1){ tmp.emplace_back(S({it1->money - C[i], it1->love + B[i]})); } break;}
      else if(it1 == states1.end()){ for(; it0 != states0.end(); ++it0){ tmp.emplace_back(S({it0->money + A[i], it0->love})); } break;}
      else if(it0->money + A[i] >= it1->money - C[i] && it0->love >= it1->love + B[i]) ++it1;
      else if(it0->money + A[i] <= it1->money - C[i] && it0->love <= it1->love + B[i]) ++it0;
      else if(it0->money + A[i] <= it1->money - C[i]) tmp.emplace_back(S({it0->money + A[i], it0->love})), ++it0;
      else tmp.emplace_back(S({it1->money - C[i], it1->love + B[i]})), ++it1;
    }
    states0.swap(states1);
    states0.swap(tmp);
    tmp.clear();
/*
for(auto &s: states0) printf("(%lld %lld) ", s.money, s.love);
puts("");
std::fflush(stdout);
*/
  }

  long long int ans = 0;
  for(auto &s: states0){
    if(s.money >= 0){
      ans = s.love;
      break;
    }
  }

  printf("%lld\n", ans);

  return 0;
}