struct POINT
{
    int h, a, q;
    bool operator < (const POINT &b) const
    {
        return a < b.a;
    }
}p[MAXN];
 
int dp[41000], num[41000];
 
int main()
{
    //ROP;
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%d%d%d", &p[i].h, &p[i].a, &p[i].q);
    sort(p, p+n);
    int ans = 0;
    dp[0] = 1;
    for (int i = 0; i < n; i++)
    {
        MS(num, 0);
        for (int j = p[i].h; j <= p[i].a; j++)
            if (!dp[j] && dp[j-p[i].h] && num[j-p[i].h] < p[i].q)
            {
                dp[j] = 1;
                num[j] = num[j-p[i].h] + 1;
                ans = max(ans, j);
            }
    }
    printf("%d\n", ans);
    return 0;
}