#include<iostream>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#include<algorithm>
using namespace std;
#define max(x,y){x>y?x:y}
const int maxnum = 1000 + 5;
int N;
int price[maxnum];
int Money;
int dp[maxnum][maxnum];
int DP()
{
    int i, j;
    sort(price + 1, price + N + 1);
    memset(dp, 0, sizeof(dp));
    Money = Money - 5;
    for (i = 1; i < N; i++)
    {
        for (j = 0; j <= Money; j++)
        {
            if ( price[i]<=j)
            {
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - price[i]] + price[i]);//这里比较的是dp[i - 1][j]，而不是dp[i - 1][j-1]之前把这个写错了
            }
            else
            {
                 dp[i][j] = dp[i - 1][j];
            }
        }
    }
    return Money + 5 - dp[N - 1][Money] - price[N];
}
int main()
{
    while (cin >> N&&N!=0)
    {
        int i;
        for (i = 1; i <= N; i++)
            cin >> price[i];

        cin >> Money;
        if (Money < 5)
        {
            cout << Money << endl; 
        }
        else
        {
            cout << DP()<< endl;
        }
    
    }
    return 0;
}