#include<cstdio>
#include<algorithm>
#include<limits>
#define rep(i,a) for(int i=0;i<(a);++i)

const int MAX_N = 16, INF = std::numeric_limits<int>::max()>>2;

int N, D[MAX_N];
int dp[1<<MAX_N+1];

int main()
{
	scanf( "%d", &N );
	rep( i, N )
		scanf( "%d", D+i );

	std::fill( dp, dp+(1<<N), -INF );
	dp[0] = 100;
	rep( S, 1<<N )
	{
		if( dp[S] < 0 )
			continue;

		int did = 1;
		rep( i, N ) if( S>>i&1 && D[i] < 0 )
			++did;
		rep( i, N ) if( !(S>>i&1) )
		{
			if( D[i] > 0 )
				dp[S|1<<i] = std::min( did*100, std::max( dp[S|1<<i], dp[S]+D[i] ) );
			else if( dp[S]+D[i] > 0 )
				dp[S|1<<i] = std::max( dp[S|1<<i], dp[S]+D[i] );
		}
	}

	printf( "%d\n", std::max( 0, dp[(1<<N)-1] ) );

	return 0;
}