#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,dis[1100],f[1100],maxn,mm;
int main(){
    while(scanf("%d",&n)&&n!=0){
        maxn=0;
        memset(f,0,sizeof(f));
        memset(dis,0,sizeof(dis)); 
        for(int i=1;i<=n;i++){
            scanf("%d",&dis[i]);
            if(dis[i]>maxn){
                maxn=dis[i];
                mm=i;
            }
        } 
        scanf("%d",&m);
        if(m<5){
            printf("%d\n",m);
            continue;
        }
        m-=5;
        for(int i=1;i<=n;i++){
            if(i==mm)    continue;
            for(int j=m;j>=dis[i];j--)
                f[j]=max(f[j],f[j-dis[i]]+dis[i]);    
        }
        printf("%d\n",5+m-f[m]-maxn);
    }
}