#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef long long ll;

int n;
ll a[1010];
ll S;
ll p;
ll ans = 0;
ll last = 0;

int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%lld", &a[i]);
	sort(a, a + n);
	scanf("%lld", &S);
	p = 1LL;
	ans = 1LL;
	last = 1LL;
	for (int i = 1; i < n; i++)
	{
		if (p >= S || a[i] >= S) break;
		if (p >= a[i] + 1LL)
		{
			last = a[i];
			continue;
		}
		ll x = a[i] - p - 1LL;
		x = (x + last - 1LL) / last;
		ans += x;
		p += x * last;
		last = a[i];
	}
	ll x = S - p;
	x = (x + last - 1LL) / last;
	ans += x;

	printf("%lld\n", ans);

	return 0;
}