#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) c.begin(), c.end()
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n;
    cin >> n;
    VI v(n), w(n);
    REP(i,n) cin >> v[i] >> w[i];
    int p;
    cin >> p;
    int m = 100001;
    VVI dp(n+1, VI(m));
    REP(i,n) REP(j,m){
        dp[i+1][j] = max(dp[i+1][j], dp[i][j]);
        if (j + w[i] < m) dp[i+1][j+w[i]] = max(dp[i+1][j+w[i]], dp[i][j] + v[i]);
    }
    FOR(j,1,m){
        if (dp[n][j] == p){
            cout << j << endl;
            break;
        }
    }
    if (dp[n][m-1] == p) cout << "inf" << endl;
    else{
        FORR(j,m-1,0){
            if (dp[n][j] == p){
                cout << j << endl;
                break;
            }
        }
    }
}