import java.util.*;

public class Main {
    static long[] incomes;
    static long[] likes;
    static long[] costs;
    static HashMap<Long, Long>[] dp;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int w = sc.nextInt();
        incomes = new long[w + 1];
        likes = new long[w + 1];
        costs = new long[w + 1];
        dp = new HashMap[w + 1];
        for (int i = 1; i <= w; i++) {
            incomes[i] = sc.nextInt();
            likes[i] = sc.nextInt();
            costs[i] = sc.nextInt();
            dp[i] = new HashMap<Long, Long>();
        }
        
        System.out.println(dfw(w, 0));
    }
    
    static long dfw(int idx, long money) {
        if (idx == 0) {
            if (money > 0) {
                return Long.MIN_VALUE;
            } else {
                return 0;
            }
        }
        if (dp[idx].containsKey(money)) {
            return dp[idx].get(money);
        }
        long ans = dfw(idx - 1, money - incomes[idx]);
        if (idx >= 2) {
            ans = Math.max(ans, dfw(idx - 2, money + costs[idx]) + likes[idx]);
        }
        dp[idx].put(money, ans);
        return ans;
    }
    
}