#ifdef LOCAL111
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { cout << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

vector<int> bit_toposort(int n)
{
	vector<int> res;
	res.reserve(1<<n);
	vector<bool> used(1<<n,false);
	function<void(int)> rec = [&](int mask){
		used[mask] = true;
		for(int i = 0; i < n; ++i) {
			if(!((mask>>i)&1)){
				if(!used[mask|(1<<i)]) rec(mask|(1<<i));
			}
		}
		res.push_back(mask);
		return;
	};
	rec(0);
	return res;
}

int main()
{
	ios_init();
	int n;
	bitset<1600> bits[17];
	REP(i,1600) bits[0][i] = true;
	REP(i,16){
		bits[i+1] = bits[i]<<100;
	}
	REP(i,17) DEBUG(bits[i]);
	while(cin >> n){
		vector<int> d(n);
		REP(i,n) cin >> d[i];
		using vb = bitset<1600>;
		vector<vector<vb>> dp((1<<n),vector<vb>(n+1));
		dp[(1<<n)-1][0][99] = true;
		auto topo = bit_toposort(n);
		dpite(ALL(topo));
		REP(i,SZ(topo)){
			int mask = topo[i];
			if(mask == (1<<n)-1) continue;
			DEBUG(bitset<16>(mask));
			REP(j,n+1){
				REP(k,n) if(!((mask>>k)&1)){
					DEBUG(k);
					if(d[k] < 0){
						if(j) dp[mask][j] |= dp[mask|(1<<k)][j-1]>>(-d[k]);
					} else {
						auto t = dp[mask|(1<<k)][j]<<d[k];
						if((t&bits[j+1]) != 0){
							t[100*(j+1)-1] = true;
							t &= ~bits[j+1];
						}
						dp[mask][j] |= t;
					}
				}
			}
		}
		int ans = 0;
		REP(i,n+1) RREP(j,1600){
			if(dp[0][i][j]){
				ans = max(ans,j+1);
				break;
			}
		}
		cout << ans << endl;
	}
	return 0;
}