#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 2147483600
#define long long long // for codeforces

#define MX 100010
long dp[2][MX+5];

int main(){
  int n;
  cin>>n;
  vector<int> v(n),w(n);
  rep(i,n) cin>>v[i]>>w[i];
  int V;
  cin>>V;

  auto prev = dp[0];
  auto crnt = dp[1];

  fill(prev, prev+MX+5, INF);
  prev[0] = 0;

  rep(i,n){
    fill(crnt, crnt+MX+5, INF);
    rep(j,MX){
      crnt[j] = min(crnt[j], prev[j]);
      if(j+v[i]<MX) crnt[j+v[i]] = min(crnt[j+v[i]], prev[j] + w[i]);
    }
    swap(crnt, prev);
  }

  for(int i = MX-1; i>=0; i--) prev[i] = min(prev[i], prev[i+1]);

  int mn = prev[V];
  if(mn == 0) mn = 1;
  cout << mn << endl;
  int mx = prev[V+1];
  if(mx >= INF) cout << "inf" << endl;
  else cout << mx-1 << endl;


  return 0;
}