1 ///poj 1011 dfs
 2 #include <cstdio>
 3 #include <iostream>
 4 #include <algorithm>
 5 #include <cstring>
 6 #include <cmath>
 7 #define INF 0x3f3f3f3f
 8 using namespace std;
 9 
10 const int MAXN = 70;
11 bool vis[MAXN];
12 int sticks[MAXN];
13 int N, sum, len;
14 bool flag;
15 
16 bool cmp(int x, int y)
17 {
18     return x>y;
19 }
20 
21 void dfs(int dep, int now_len, int st)  ///当前已经使用的木条数目，当前木条的长度， 需要处理的木条的下标
22 {
23     if(flag) return;
24     if(now_len == 0)       ///找木棍头
25     {
26         int k = 0;
27         while(vis[k]) k++;
28         vis[k] = true;
29         dfs(dep+1, sticks[k], k+1);
30         vis[k] = false;
31         return;
32     }
33     if(now_len == len)
34     {
35         if(dep == N) flag = true;   ///找到满足条件的len了
36         else dfs(dep, 0, 0);   ///没有用完，开始凑新的一根长度为len的木棍
37         return;
38     }
39     for(int i = st; i < N; i++)
40     {
41         if(!vis[i] && now_len + sticks[i] <= len)
42         {
43             if(!vis[i-1] && (sticks[i-1] == sticks[i])) continue;
44             vis[i] = true;
45             dfs(dep+1, now_len+sticks[i], i+1);
46             if(flag) return;
47             vis[i] = false;
48         }
49     }
50 }
51 
52 void init()
53 {
54     memset(vis, 0, sizeof(vis));
55     flag = false;
56     sum = 0;
57 }
58 
59 int main()
60 {
61     while(~scanf("%d", &N) && N )
62     {
63         init();
64         for(int i = 0; i < N; i++)
65         {
66             scanf("%d", &sticks[i]);
67             sum+=sticks[i];
68         }
69         sort(sticks, sticks+N, cmp);
70         for(len = sticks[0]; len < sum; len++)
71         {
72             if(sum%len==0)
73             {
74                 dfs(0, 0, 0);
75                 if(flag) break;
76             }
77         }
78         printf("%d\n", len);
79     }
80     return 0;
81 }