#include<bits/stdc++.h>
using namespace std;
int n;
const int N=70;
int bz[N],w[N];
int len,sum;
int dfs(int u,int s,int start)
{
	if(u*len==sum)
	return 1;
	if(s==len)
	return dfs(u+1,0,1);
	for(int i=start;i<=n;i++)
	{
		if(bz[i]==1)
		continue;
		if(s+w[i]<=len)
		{
			bz[i]=1;
			if(dfs(u,s+w[i],i+1))
			return 1;
			bz[i]=0;
			if(s==0)
			return 0;
			if(s+w[i]==len)
			return 0;
			int j=i;
			while(j<=n&&w[i]==w[j])
			j++;
			i=j-1;
		}
	}
	return 0;
}
int main()
{
	cin>>n;
	sum=0;
	for(int i=1;i<=n;i++)
	{
		cin>>w[i];
		sum+=w[i];
	}
	sort(w+1,w+n+1);
	reverse(w+1,w+n+1);
	int len=1;
	while(1)
	{
		if(sum%len==0&&dfs(0,0,1)==1)
		{
			cout<<len<<endl;
			break;
		}
		len++;
	}
	return 0;
}