不要是特判！！！

没O2&开O2（没错我是@sz_jinzikai）

# include <bits/stdc++.h>

# define old_six \
	ios::sync_with_stdio (0);\
	\
	cin.tie (0);\
	\
	cout.tie (0);

# define reg register

# define inl inline

using namespace std;

typedef size_t st;

typedef long long ll;

typedef pair <int, int> pii;

typedef pair <ll, ll> pll;

int sum, ans, n, a[70], g, maxx;

bool vis[70];

void dfs (int now, int len, int s) {

	if (now > sum / g) {

		cout << g;

		exit (0);

	}

	if (len == g)
		return dfs (now + 1, 0, 0);

	int last = 0;

	for (reg int i = s; i < n; ++ i)
		if (! vis[i] && len + a[i] <= g && last != a[i]) {

			vis[i] = 1;

			dfs (now, len + a[i], i);

			vis[i] = 0;

			if (! len || len + a[i] == g)
				return ;

			last = a[i];

		}

	return ;

}

int main () {

	old_six

	cin >> n;

	for (reg int i = 0; i < n; ++ i)
		cin >> a[i], maxx = max (maxx, a[i]), sum += a[i];

	sort (a, a + n, greater <int> ());

	for (g = maxx; g <= sum; ++ g)
		if (sum % g < 1) {

			for (reg int i = 0; i < n; ++ i)
				vis[i] = 0;

			dfs (1, 0, 0);

		}

	return 0;

}