#include<iostream>
#include<algorithm>
using namespace std;
int s[65];
int n;
int x;
bool bfs(int sum,int m)
{
	if(sum==0)
	{
		m--;
		if(m==0)return true;
		else if(bfs(x,m)==false)return false;
		else return true;
	}
	else if(sum==x)
	{
		int i=n;
        do{i--;}while(s[i]<0);
		s[i]=-s[i];
		if(bfs(sum+s[i],m)==false){s[i]=-s[i];return false;}
		return true;
	}
	else 
	{
		int i=n;
		goto check;
check:do{i--;}while((i>=0)&&(s[i]<0||s[i]>sum||s[i]==s[i+1]));
		if(i>=0)
		{   s[i]=-s[i];
		    if(bfs(sum+s[i],m)==false){s[i]=-s[i];goto check;}
			return true;
		}
		else return false;
	}
}
int main()
{
	while(cin>>n&&n)
	{
	    int sum=0;
		for(int i=0;i<n;i++){cin>>s[i];sum+=s[i];}
		sort(s,s+n);
		for(int i=n;i>0;i--)if(sum%i==0){x=sum/i;if(bfs(x,i)){cout<<x<<endl;break;}for(int i=0;i<n;i++)s[i]=abs(s[i]);}
	}
}