#include<bits/stdc++.h>
using namespace std;
int a[101],v[101],n,b,len,cnt = 0;
bool dfs(int s,int c,int last)
{
	if(s > cnt)
	{
		return true; 	
	}
	if(c == len)
	{
		return dfs(s + 1,0,1);
	}
	int f = 0;
	for(int i = last;i <= n;i++)
	{
		if(!v[i] && c + a[i] <= len && f != a[i])
		{
			v[i] = 1;
			if(dfs(s,c + a[i],i + 1))
			{
				return true;
			}
			f = a[i];
			v[i] = 0;
			if(c == 0 || c + a[i] == len)
			{
				return false;
			}
		}
	}
	return false;
}
int cmp(int a,int b)
{
	return a > b;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	int sum = 0,ve = 0;
	for(int i = 1;i <= n;i++)
	{
		cin>>b;
		if(b > 50)
		{
			continue;
		}
		a[i] = b;
		sum += a[i];
		ve = max(ve,a[i]);
	}
	sort(a + 1,a + n + 1,cmp);
	for(len = ve;len <= sum;len++)
	{
		if(sum % len)
		{
			continue;	
		}
		cnt = sum / len;
		memset(v,0,sizeof(v));
		if(dfs(1,0,1))
		{
			break;
		}
	}
	cout<<len;
	return 0;
}