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

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

    // create a priority queue to store the strengths of the animals
    priority_queue<int> pq;

    // read in the strengths and add them to the priority queue
    for (int i = 0; i < n; i++) {
        int strength;
        cin >> strength;
        pq.push(strength);
    }

    // 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 = pq.top();
        pq.pop();

        // calculate the sum of the strengths of the attackers and defenders
        int attackers = sum - weakest;
        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 << pq.size() << endl;

    return 0;
}