import sys
import math

def main():
    sys.setrecursionlimit(1 << 25)
    N = int(sys.stdin.readline())
    items = []
    for _ in range(N):
        c, v = map(int, sys.stdin.readline().split())
        items.append((c, v))
    
    # Initialize DP
    INF = -math.inf
    dp = [[INF] * (N + 1) for _ in range(N + 1)]
    dp[0][0] = 0
    
    for i in range(N):
        ci, vi = items[i]
        weight = i + 1
        
        # Iterate through all possible counts and weights
        for k in range(N, -1, -1):
            for w in range(N, -1, -1):
                if dp[k][w] == INF:
                    continue
                # Determine the maximum number of items we can take from this type
                max_t = min(ci, (N - w) // weight)
                for t in range(1, max_t + 1):
                    new_k = k + t
                    new_w = w + t * weight
                    if new_k > N or new_w > N:
                        continue
                    if dp[new_k][new_w] < dp[k][w] + t * vi:
                        dp[new_k][new_w] = dp[k][w] + t * vi
    
    # For each k, find the maximum value where weight <= N
    result = []
    for k in range(1, N + 1):
        max_val = INF
        for w in range(k, N + 1):
            if dp[k][w] > max_val:
                max_val = dp[k][w]
        result.append(max_val)
    
    for val in result:
        print(val)

if __name__ == '__main__':
    main()