luoguP1120

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include <cstring>
#include <vector>
using namespace std;
const int maxn=67;
int vis[maxn],a[maxn],N,L;
bool dfs(int left,int now,int pos)
{
    if(left==0&&now==0) return 1;//终止
    if(now==0) { now=L; pos=0; }
    for(int i=pos+1;i<=N;i++){
        if(vis[i]||a[i]>now) continue; //不符合
        if(!vis[i-1]&&a[i]==a[i-1]) continue; //减枝1
        vis[i]=1;
        if(dfs(left-1,now-a[i],i)) return 1;
        vis[i]=0;
        if(a[i]==now||now==L) return 0; //减枝2
    }
    return 0;
}
int main()
{
    int sum,ans;
    while(~scanf("%d",&N)&&N){
        sum=0;
        for(int i=0;i<=N;i++) vis[i]=0;
        for(int i=1;i<=N;i++){
            scanf("%d",&a[i]);
            if(a[i]>50) {
                i--; N--;
            }
            else sum+=a[i];
        }
        sort(a+1,a+N+1);
        for(int i=1;i<=N/2;i++) swap(a[i],a[N+1-i]);
        ans=sum;
        for(L=a[N];L<=sum;L++){
            if(sum%L!=0) continue;
            //cout<<L<<endl;
            if(dfs(N,L,0)){
                //cout<<L<<"?"<<endl;
                ans=L; break;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}