#include <iostream>
#include<queue>
#include<algorithm>
using namespace std;
long long x [300000] ;
long long y [300000] ;
int n , cap;
int main() {
int a;
cin>>a ;
for(int j = 0 ; j <a ; j++){
cin>>x[j];
}
sort(x , x+a) ;
int j = 0 ;
int i=0 ;
n = x[a-1];
++i;
while(n>=x[j] )
{
if(n>=x[j])
{ n = n - x[j];
++i;}
++j;
}
cout<<i;
// your code goes here
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxxdWV1ZT4KI2luY2x1ZGU8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwpsb25nIGxvbmcgeCBbMzAwMDAwXSA7IApsb25nIGxvbmcgeSBbMzAwMDAwXSA7CmludCBuICAsIGNhcDsKCmludCBtYWluKCkgeyAKCWludCBhOyAKCWNpbj4+YSA7IAoJZm9yKGludCBqID0gMCA7IGogPGEgOyBqKyspewoJCWNpbj4+eFtqXTsKCX0KCXNvcnQoeCAsIHgrYSkgOwoJaW50IGogPSAwIDsKCWludCBpPTAgOyAKCW4gPSB4W2EtMV07CgkrK2k7Cgl3aGlsZShuPj14W2pdICkKewoJCWlmKG4+PXhbal0pCgl7CW4gPSBuIC0geFtqXTsKCQkrK2k7fQoJCSsrajsKCX0KCWNvdXQ8PGk7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglyZXR1cm4gMDsKfQ==