CF_160A

// Codeforces Round 160A
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int n, sum = 0, biggest_part, ct = 0;
    cin >> n;
    int nn[n];
    for(int i = 0; i < n; i++)
    {
        cin >> nn[i];
        sum += nn[i];
    }
    if(sum % 2 == 0)
    {
        biggest_part = (sum/2)+1;
    }
    else
    {
        biggest_part = (sum+1)/2;
    }
    sort(nn, nn+n, greater<int>()); //sortirovka ot bolshego k menshemu
    int biggest_sum = 0;
    for(int i = 0; i < n; i++)
    {
        if(biggest_sum < biggest_part)
        {
            biggest_sum += nn[i];
            ct++;
            if(biggest_sum > biggest_part)
            {
                break;
            }
        }
    }
    cout << ct;
    return 0;
}