uva 307

暴力剪枝

 

//====================================================================||
//                        Name  : Sticks.cpp                             ||
//                     Date : 2013/5/19 下午6:30:00                         ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 105
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int n;
int x[M];
int all;
int target;
bool cmp(int x,int y){
    return x>y;
}
int cnt;
bool vis[M];
bool dfs(int nowx,int index,int cnt){
//    debug("%d %d %d %d\n",nowx,index,target,cnt);
    if(cnt*target==all)return true;

    
    for(int i=index;i<n;i++){
        if(vis[i]==0&&x[i]+nowx==target){
            vis[i]=1;
            if(dfs(0,0,cnt+1))return true;
            vis[i]=0;
            return false;
        }
        else if(vis[i]==0&&x[i]+nowx<target){
            vis[i]=1;
            if(dfs(x[i]+nowx,i+1,cnt))return true;
            vis[i]=0;
            if(nowx==0)return false;
        }
    }

    return false;

}
void solve(){
    for(int i=x[0];i<=all;i++){
        if(all%i!=0)continue;
        Set(vis,0);
        target=i;
        if(dfs(0,0,0))break;
    }
    printf("%d\n",target);
}
int main() {
    ios_base::sync_with_stdio(0);
    while(~scanf("%d",&n)&&n){
        all=0;
        for(int i=0;i<n;i++){
            scanf("%d",&x[i]);
            all+=x[i];
        }
        sort(x,x+n,cmp);
        solve();
    }

















}