#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#define N 70 int f, vis[N], v, n, a[N]; int cmp(const void *a, const void *b)
{
return *(int *)b - *(int *)a;
} void DFS(int w, int sum)
{
int i;
if(sum == )
f = ;
else
{
for(i = ; i < n && f == ; i++)
{
if(!vis[i] && w - a[i] >= )
{
vis[i] = ;
if(w - a[i] == )
DFS(v, sum - a[i]);
else
DFS(w - a[i], sum - a[i]);
vis[i] = ;
if(w == a[i])
return ;
if(w == v && a[i] < v)
return ;
while(a[i] == a[i + ])
i++;
}
}
}
}
int main()
{
int i, sum;
while(scanf("%d", &n), n)
{
sum = f = ;
for(i = ; i < n ; i++)
{
scanf("%d", &a[i]);
sum += a[i];
}
qsort(a, n, sizeof(a[]), cmp);
for(v = a[] ; v <= sum ; v++)
{
if(sum % v == )
{
if(sum == v)
printf("%d\n", sum);
else
{
memset(vis, , sizeof(vis));
DFS(v, sum);
if(f == )
{
printf("%d\n", v);
break;
}
}
}
}
}
return ;
}