#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define ll long long
#define _cle(m, a) memset(m, a, sizeof(m))
#define repu(i, a, b) for(int i = a; i < b; i++)
#define repd(i, a, b) for(int i = b; i >= a; i--)
#define sfi(n) scanf("%d", &n)
#define sfl(n) scanf("%I64d", &n)
#define pfi(n) printf("%d\n", n)
#define pfl(n) printf("%I64d\n", n)
#define MAXN 1105
int dp[MAXN];
int v[MAXN];
int main()
{
    int n, m;
    while(sfi(n), n)
    {
        repu(i, 0, n) sfi(v[i]);
        sfi(m);
        if(m < 5) { pfi(m); continue; }
        sort(v, v + n);
        _cle(dp, 0);
        for(int i = 0; i < n - 1; i++)
            for(int j = m - 5; j >= v[i]; j--)
            {
                dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
            }
        pfi(m - v[n - 1] - dp[m - 5]);
    }
    return 0;
}