def main(): import sys input = sys.stdin.read().split() idx = 0 N = int(input[idx]) idx += 1 # Read the first type (i=1) c1 = int(input[idx]) v1 = int(input[idx + 1]) idx += 2 # Initialize dp_prev for other types (i >= 2) dp_prev = [[-float('inf')] * (N + 1) for _ in range(N + 1)] dp_prev[0][0] = 0 # Process other types (i >= 2) for i in range(2, N + 1): ci = int(input[idx]) vi = int(input[idx + 1]) idx += 2 weight = i remaining = ci m = 1 while remaining > 0: take = min(m, remaining) # Update DP in reverse order for k in range(N, take - 1, -1): for w in range(N, take * weight - 1, -1): if dp_prev[k - take][w - take * weight] != -float('inf'): new_val = dp_prev[k - take][w - take * weight] + take * vi if new_val > dp_prev[k][w]: dp_prev[k][w] = new_val remaining -= take m *= 2 # Precompute prefix maxima for each k_prev max_w_prev = [[-float('inf')] * (N + 1) for _ in range(N + 1)] for k_prev in range(N + 1): current_max = -float('inf') for w in range(N + 1): if dp_prev[k_prev][w] > current_max: current_max = dp_prev[k_prev][w] max_w_prev[k_prev][w] = current_max # Compute answers by combining with type 1 for k_total in range(1, N + 1): max_val = -float('inf') for k_prev in range(0, k_total + 1): m = k_total - k_prev allowed_w = N - m if allowed_w < 0: continue if k_prev > N or allowed_w > N: continue current_max_w = min(allowed_w, N) val = max_w_prev[k_prev][current_max_w] if val == -float('inf'): continue total_val = val + m * v1 if total_val > max_val: max_val = total_val print(max_val) if __name__ == '__main__': main()