#include <bits/stdc++.h>
using namespace std;
int l[110],d[110];
int n;
double ans = -1, p;
void dfs(int step, int a, int b, int c)
{
	if (a >= p || b >= p || c >= p) return;
	if(step > n)
	{
		double s = 0;
		s = sqrt(p * (p - a) * (p - b) * (p - c));
		ans = max(ans,s);
		if (clock() > 0.9 * CLOCKS_PER_SEC)
		{
			cout << int(ans * 100);
			exit(0);
		}
		return;
	}
	dfs(step + 1, a + l[step], b, c);
	dfs(step + 1, a, b + l[step], c);
	dfs(step + 1, a, b, c + l[step]);
}
int main()
{
	cin >> n;
	for(int i = 1;i <= n; i ++) 
	{
		cin >> l[i];
		p += l[i];
	}
	p /= 2.0;
	dfs(1, 0, 0, 0);
	cout << int(ans * 100);
    return 0;
}

求大佬看看怎么优化