#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
int a[N], dp[N][N];
int main(){
	freopen("card.in","r",stdin);
	freopen("card.out","w",stdout);
	int n, m;
	cin >> n;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	cin >> m;
	if(m < 5){
		cout << m << endl;
		return 0;
	}
	int t = m;
	m -= 5;
	sort(a+1, a+1+n);
	for (int i = 1; i < n; i++){
		for(int j = 0;j <= m; j ++){
			if(j >= a[i]){
				dp[i][j] = max(dp[i-1][j],dp[i-1][j-a[i]]+a[i]);
			}else{
				dp[i][j] = dp[i-1][j];
			}
		}
	}
	cout << t - a[n] - dp[n-1][m] << endl;
	return 0;
}