#include<bits/stdc++.h>
using namespace std;
long long int solve(long double pos, vector<long long int>& a, int i, int n, char c){
if(i == n) return 0;
long long int plus = 0, minus = 0;
if(c == 'p'){
plus = solve(pos + a[i], a, i+1, n, 'p');
if(pos - a[i] > 0){
minus = solve(pos - a[i], a, i+1, n, 'p');
}
else{
minus = 1 + solve(pos - a[i], a, i+1, n, 'n');
}
}
if(c == 'n'){
minus = solve(pos - a[i], a, i+1, n, 'n');
if(pos + a[i] > 0){
plus = 1 + solve(pos + a[i], a, i+1, n, 'p');
}
else{
plus = solve(pos + a[i], a, i+1, n, 'n');
}
}
return max(plus, minus);
}
int main(){
int n;
cin>>n;
vector<long long int> a(n);
for(int i = 0; i < n; i++){
cin>>a[i];
}
long long int ans = solve(0.5, a, 0, n, 'p');
cout<<ans<<endl;
}