from itertools import *
from bisect import *
# from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    n=II()
    vw=[LI() for _ in range(n)]
    maxv=II()
    sumw=sum(w for v,w in vw)
    dp=[0]*(sumw+1)
    for v,w in vw:
        for i in range(sumw-w,0,-1):
            #if dp[i]==0:continue
            if dp[i]+v>dp[i+w]:dp[i+w]=dp[i]+v
        if v>dp[w]:dp[w]=v
    #print(dp)
    print_min=False
    for i,v in enumerate(dp[1:],1):
        if v==maxv and not print_min:
            print(i)
            print_min=True
        if v>maxv:
            print(i-1)
            exit()
    print("inf")

main()