def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    items = []
    for i in range(N):
        c_i = int(input[ptr])
        v_i = int(input[ptr + 1])
        ptr += 2
        items.append((c_i, v_i))
    
    INF = -10**18
    dp = [[INF] * (N + 1) for _ in range(N + 1)]
    dp[0][0] = 0
    
    for i in range(N):
        weight = i + 1
        c_i, v_i = items[i]
        for k in reversed(range(N + 1)):
            for w in reversed(range(N + 1)):
                if dp[k][w] == INF:
                    continue
                max_t = min(c_i, (N - k), (N - w) // weight)
                if max_t <= 0:
                    continue
                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:
                        break
                    if dp[new_k][new_w] < dp[k][w] + t * v_i:
                        dp[new_k][new_w] = dp[k][w] + t * v_i
    
    for k in range(1, N + 1):
        max_val = max(dp[k][k:N+1])
        print(max_val)

if __name__ == "__main__":
    main()