#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>

using namespace std;

#define REP(i,n)	for(int i=0;i<(n);++i)
#define REPS(i,s,t)	for(int i=(s);i<(t);++i)

#define INF 		2000000007
#define MOD			1000007

#define MAX 		105

typedef unsigned int 			uint;
typedef unsigned long long int	ull;
typedef long long int ll;

int DP[MAX][100005];

int main(){
	int N;cin>>N;

	vector<int> V(N);
	vector<int> W(N);
	REP(i,N){cin>>V[i]>>W[i];}
	int maxV;cin>>maxV;

	int suml = accumulate(V.begin(),V.end(),0);
	if(maxV >= suml){
		int sumW = accumulate(W.begin(),W.end(),0);
		cout << sumW << endl;
		cout << 'i'<<"n" << "f" << endl;
		return 0;
	}

	REPS(i,1,N+1){
		REPS(j,1,100001){
			if(j-W[i-1]<0){
				DP[i][j]=DP[i-1][j];
				continue;
			}
			DP[i][j] = max(DP[i-1][j],DP[i-1][j-W[i-1]]+V[i-1]);
		}
	}

	int k=1;
	while(DP[N][k++]!=maxV);
	cout << (--k) << endl;
	while(DP[N][++k]==maxV);
	cout << (k-1) << endl;
	
	return 0;
}