#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
	int n;
	cin >> n;
	vector<long long> arr(n);
	for (int i = 0; i < n; ++i)
		cin >> arr[i];
	sort(arr.begin(), arr.end());
	long long s;
	cin >> s;
	long long sum = 0;
	long long cnt = 0;
	long long prev = -1;
	while (true)
	{
		if (sum >= s)
			break;
		int ind = upper_bound(arr.begin(), arr.end(), sum + 1) - 1 - arr.begin();
		//cout << ind << endl;
		long long zn = arr[ind];
		if (ind == arr.size() - 1)
		{
			cnt = cnt + (s - sum + zn - 1) / zn;
			break;
		}
		++cnt;
		sum += zn;
		prev = zn;
	}
	cout << cnt << endl;
	return 0;
}