def dfs(t,m,v):
    global ans
    if t==w:
        if m >= 0: ans = max(ans,v)
        return
    dfs(t+1,m+abc[t][0],v)
    if t+1 < w: dfs(t+2,m-abc[t+1][2],v+abc[t+1][1])

w = int(input())
abc = [list(map(int,input().split())) for _ in range(w)]
ans = 0
dfs(0,0,0)
print(ans)