import sys

def main():
    N = int(sys.stdin.readline())
    items = []
    for _ in range(N):
        c, v = map(int, sys.stdin.readline().split())
        items.append((c, v))
    
    # Initialize DP table
    INF = -10**18
    dp = [[INF] * (N + 1) for _ in range(N + 1)]
    dp[0][0] = 0
    
    for idx in range(N):
        i = idx + 1
        c_i, v_i = items[idx]
        
        # Binary decomposition of c_i
        s = 1
        parts = []
        remaining = c_i
        while remaining > 0:
            take = min(s, remaining)
            parts.append(take)
            remaining -= take
            s <<= 1
        
        # Process each part
        for part in parts:
            s_part = part
            for k in range(N, s_part - 1, -1):
                for w in range(N, s_part * i - 1, -1):
                    prev_k = k - s_part
                    prev_w = w - s_part * i
                    if dp[prev_k][prev_w] != INF:
                        new_val = dp[prev_k][prev_w] + s_part * v_i
                        if new_val > dp[k][w]:
                            dp[k][w] = new_val
    
    # Compute answers
    for k in range(1, N + 1):
        max_val = max(dp[k][k:N+1])
        print(max_val)

if __name__ == '__main__':
    main()