#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

int f[1005],a[1005];

int max(int x,int y)
{
    return x>y?x:y;
}

int main()
{
    int n,V,i,j;
    while(scanf("%d",&n)&&n!=0){
        memset(f,0,sizeof(f));
        memset(a,0,sizeof(a));
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        sort(a+1,a+n+1);
        scanf("%d",&V);
        for(i=1;i<=n-1;i++){
            for(j=V-5;j>=0;j--){
                if(j-a[i]>=0){
                    f[j]=max(f[j],f[j-a[i]]+a[i]);
                }
            }
        }
        if(V<5) printf("%d\n",V);
        else printf("%d\n",V-f[V-5]-a[n]);
    }
    return 0;
}