再剪枝，我给你树干子都剪了！！！

#include<bits/stdc++.h>
using namespace std;
int n,total,ma;
vector<int> stick;
vector<bool> used;
bool dfs(int current,int count,int start,int target){
	if(count*target==total) return 1;
	if(current==target) return dfs(0,count+1,0,target);
	int	fail=0;
	for(int i=start;i<n;i++){
		if(!used[i] && current+stick[i]<=target && stick[i]!=fail){
			used[i]=1;
			if(dfs(current+stick[i],count,i+1,target)){
				return 1;
			}
			used[i]=0;
			fail=stick[i];
			if(current==0 || current+stick[i]==target){
				return 0;
			}
		}
	}
	return 0;
}
int main(){
	scanf("%d",&n);
	stick.resize(n);
	used.resize(n,0);
	for(int i=0;i<n;i++){
		scanf("%d",&stick[i]);
		total+=stick[i];
		ma=max(ma,stick[i]);
	}
	sort(stick.begin(),stick.end(),greater<int>());
	for(int i=ma;i<=total/2;i++){
		if(total%i==0){
			fill(used.begin(),used.end(),0);
			if(dfs(0,0,0,i)){
				printf("%d",i);
				return 0;
			}
		}
	}
	printf("%d",total);
    return 0;
}