def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    items = []
    for i in range(1, N+1):
        c_i = int(input[idx])
        v_i = int(input[idx+1])
        idx += 2
        items.append((i, c_i, v_i))
    
    INF = -1 << 60
    dp = [[INF] * (N + 1) for _ in range(N + 1)]
    dp[0][0] = 0
    
    # Process first item (i=1, weight=1)
    i, c_i, v_i = items[0]
    assert i == 1
    for t in range(0, c_i + 1):
        for k in range(N, t - 1, -1):
            for w in range(N, t * i - 1, -1):
                if dp[k - t][w - t * i] != INF:
                    if dp[k][w] < dp[k - t][w - t * i] + t * v_i:
                        dp[k][w] = dp[k - t][w - t * i] + t * v_i
    
    # Process other items
    for i, c_i, v_i in items[1:]:
        for t in range(0, c_i + 1):
            for k in range(N, t - 1, -1):
                for w in range(N, t * i - 1, -1):
                    if dp[k - t][w - t * i] != INF:
                        if dp[k][w] < dp[k - t][w - t * i] + t * v_i:
                            dp[k][w] = dp[k - t][w - t * i] + t * v_i
    
    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]
        print(max_val)

if __name__ == "__main__":
    main()