n = int(input())
info = [list(map(int, input().split())) for i in range(n)]
v = int(input())

sum_w = 0
for i in range(n):
    sum_w += info[i][1]

# dp[i][j] := i番目の荷物を入れたときの、重さj以下で実現できる最大価値
dp = [[0]*(sum_w+1) for i in range(n+1)]

for i in range(n):
    for j in range(sum_w+1):
        if j - info[i][1] < 0:
            dp[i+1][j] = dp[i][j]
        else:
            dp[i+1][j] = max(dp[i][j], dp[i][j-info[i][1]] + info[i][0])

flag = False
min_w = 1
max_w = "inf"
for i in range(1, sum_w+1):
    if dp[n][i] == v:
        min_w = i
        break

for j in range(i+1, sum_w+1):
    if dp[n][j] != v:
        max_w = j - 1
        break

print(min_w)
print(max_w)