#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll n, db= 0, s = 0;
    cin >> n;
    vector<int>vec(n + 1);
    for (size_t i = 0; i < n; i++)
    {
        cin >> vec[i];
        s += vec[i];
    }

    while (s>0)
    {
        ll l = n + 1;
        auto it = max_element(vec.begin(), vec.begin() + l);
        l = distance(vec.begin(), it);
        s -= vec[l];
        vec[l] = 0;
        while (it!=vec.begin())
        {
            it = max_element(vec.begin(), vec.begin() + l);
            l = distance(vec.begin(), it);
            s -= vec[l];
            vec[l] = 0;
        }
        db++;
    }
    cout << db << endl;
    return 0;
}