#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int n;
    cin >> n;

    // create an array to store the strengths of the animals
    int strengths[n];
    for (int i = 0; i < n; i++) {
        cin >> strengths[i];
    }

    // sort the strengths in decreasing order
    sort(strengths, strengths + n, greater<int>());

    // keep track of the sum of the strengths of the animals
    int sum = 0;
    for (int i = 0; i < n; i++) {
        // get the strength of the weakest animal
        int weakest = strengths[i];

        // calculate the sum of the strengths of the attackers and defenders
        int attackers = sum;
        int defenders = weakest;

        // check if the weakest animal should leave
        if (attackers > defenders) {
            // the weakest animal should leave
            break;
        }

        // the weakest animal should stay
        sum += weakest;
    }

    // output the number of animals remaining
    cout << n - (int)(strengths + n - upper_bound(strengths, strengths + n, sum)) << endl;

    return 0;
}