1 #include <iostream>

 2 #include <stdio.h>

 3 #include <algorithm>

 4 #include <string.h>

 5 using namespace std;

 6 bool cmp(int a,int b)

 7 {

 8     return a<b;

 9 }

10 int main()

11 {

12     int n,k[1001],f[1001],m;

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

14     {

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

16         {

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

18         }

19         sort(k,k+n,cmp);

20         scanf("%d",&m);

21         if(m>=5)

22         {

23             memset(f,0,sizeof(f));

24             for(int i = 0; i < n-1; i++)

25             for(int j = m-5; j>=k[i];j--)

26             {

27                 if(f[j-k[i]]+k[i]>f[j]&&f[j-k[i]]+k[i]<=m-5)//注意这里的f[j-k[i]]+k[i]<=m-5。

28                 f[j] = f[j-k[i]]+k[i];

29             }

30             printf("%d\n",m-f[m-5]-k[n-1]);

31         }

32         else printf("%d\n",m);

33     }

34     return 0;

35 }