#include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 const int N = ;

 int dp[N];

 int value[N];

 int main()

 {

     int n;

     while (scanf("%d", &n) == , n)

     {

         for (int i = ; i < n; i++)

             scanf("%d", &value[i]);

         int v;

         scanf("%d", &v);

         if (v < )//如果初始条件都不满足，直接输出金额

         {

             printf("%d\n", v);

             continue;

         }

         sort(value, value + n);//排序

         memset(dp, , sizeof(dp));

         //01背包

         for (int i = ; i < n - ; i++)

         {

             for (int j = v - ; j >= value[i]; j--)

                 if (dp[j] < dp[j - value[i]] + value[i])

                     dp[j] = dp[j - value[i]] + value[i];

         }

         printf("%d\n", v - dp[v - ] - value[n - ]);

     }

     return ;

 }