#include <bits/stdc++.h>
using namespace std;
int n, a[1000010], w, maxn = -1, ans, sum, maxid;
int main() {
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    cin >> w;
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; i++)
        if(w < a[i]) {maxn = a[i - 1]; maxid = i - 1; break;}
    if(maxn == -1) maxn = a[n], maxid = n;
    //cout << maxn << '\n';
    //cout << (1 < maxid);
    //cout << (sum + a[1] <= maxn);
    for(int i = 1; i < maxid && sum + a[i] <= maxn; i++) {
        ans++, sum += a[i];
        //cout << sum << '\n';
    }
    cout << ans;
    return 0;
}
// WA 第二个点