#include <cstdio>#include <cstring>#include <cmath>#include <iostream>#include <algorithm>#include <queue>#include <cstdlib>#include <vector>#include <set>#include <map>#define LL long long#define mod 1000000007#define inf 0x3f3f3f3f#define N 10010using namespace std;struct node{    int w,p,q;    bool operator<(const node &a)const    {        return q<a.q;    }}s[50];int dp[2010];int max(int a,int b){    return a>b?a:b;}int main(){    int n;    while(scanf("%d",&n)>0)    {        if(n<0)break;        int v=0;        for(int i=1;i<=n;i++)            scanf("%d%d%d",&s[i].p,&s[i].w,&s[i].q),v=max(v,s[i].q);        sort(s+1,s+n+1);        memset(dp,0,sizeof(dp));        for(int i=1;i<=n;i++)        for(int j=s[i].q;j>=s[i].w;j--)        dp[j]=max(dp[j],dp[j-s[i].w]+s[i].p);        int mx=-1;        for(int i=1;i<=v;i++)mx=max(mx,dp[i]);        printf("%d\n",mx);    }}