#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

int n,m,mx,sum;

int num[],vis[];

int cmp(int a,int b){

    return a>b;

}

void dfs(int ans,int s,int goal,int now){

    if(s*goal==sum){ printf("%d",goal); exit(); }

    if(sum-ans<num[m])    return ;

    if(ans==goal){ dfs(,s+,goal,);return ; }

    for(int i=now;i<=m;i++){

        if(!vis[i]&&num[i]+ans<=goal){

            vis[i]=;

            dfs(ans+num[i],s,goal,i+);

            vis[i]=;

            if(ans+num[i]==goal||ans==)    break;

            while(num[i]==num[i+])    i++;

        }

    }

}

int main(){

    scanf("%d",&n);

    for(int i=;i<=n;i++){

        int x;scanf("%d",&x);

        if(x>)    continue;

        num[++m]=x;sum+=x;

        mx=max(mx,x);

    }

    sort(num+,num++m,cmp);

    for(int i=mx;i<=sum/;i++)

        if(sum%i==)

            dfs(,,i,);

    printf("%d",sum);

}