/*
    Accepted    2546    31MS    1420K    525 B    G++    1340502116
*/
#include"cstdio"
#include"cstring"
#include"algorithm"
using namespace std;
const int MAXN=1005;
int n,W;
int w[MAXN];
int dp[MAXN];
int main()
{
    while(scanf("%d",&n)!=EOF&&n!=0)
    {
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++)    scanf("%d",&w[i]);
        scanf("%d",&W);
        if(W<5)
        {
            printf("%d\n",W);
            continue;
        }
        sort(w,w+n);
        int V=W-5;
        for(int i=0;i<n-1;i++)
        {
            for(int j=V;j>=w[i];j--)    dp[j]=max(dp[j],dp[j-w[i]]+w[i]);
        }
        printf("%d\n",W-dp[V]-w[n-1]);
    }
    
    return 0;
}