#include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cmath>

 #include<cstring>

 using namespace std;

 struct block

 {

     int h,a,c;

     bool operator < (const block& x) const

     {

         return a<x.a;

     }

 };

 const int MAXN=+;

 int dp[MAXN];

 block m[];

 int k,max=-;

 int main()

 {

     scanf("%d",&k);

     memset(dp,-,sizeof(dp));

     dp[]=;

     int max=-;

     for (int i=;i<k;i++) scanf("%d%d%d",&m[i].h,&m[i].a,&m[i].c);

     sort(m,m+k);

     for (int i=;i<k;i++)

     {

         int a=m[i].a;

         int h=m[i].h;

         int c=m[i].c;

         if (a>max) max=a;

         for (int j=;j<=a;j++)

         {

             if (dp[j]>=) dp[j]=c;

             else

             {

                 if (j<h || dp[j-h]<=)  dp[j]=-;

                 else dp[j]=dp[j-h]-;

             }

         }

     }

     for (int i=max;i>=;i--) if (dp[i]!=-)

     {

         cout<<i<<endl;

         break;

     }

     return ;

 }