#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define momen ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define ld long double
#define fp(n) for(int i=0;i<n;i++)
#define fp1(n) for(int i=1;i<=n;i++)
#define all(v) v.begin() , v.end()
const int mod = 1e9 + 7, N = 1e6 + 5, M = 8e6 + 5;
const ll LG = 20, inf = 1e9 + 6;


int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};


void solve(int z) {
    int n,m ;
    cin>>n;
    vector<int>v(n) ;
    for (int i = 0; i < n; ++i) {
        cin>>v[i] ;
    }
    sort(v.rbegin() , v.rend()) ;
    vector<ll>pre(n+1) ;
    vector<ll>range(n+1) ;
    for (int i = 0; i <= n; ++i) {
        if (i)
            pre[i] = pre[i-1] ;
        if (i<n)
            pre[i]+= v[i] ;
    }
    ll sum = 0;
    for (int i = 1; i < n; ++i) {
        sum+= range[i] + v[i] ;
        if (sum < pre[i] - sum) {
            ll dif = pre[i] - 2*sum ;
            auto it = lower_bound(all(pre), pre[i] + dif ) ;
            if (it == pre.end())
                return void(cout<<i) ;
            int idx = it  - pre.begin() ;
            range[idx+1]-= v[i] ;
        }
        else
            range[i+1]-=v[i] ;
    }
    cout<<n ;

}


int main() {
    momen
    int t = 1;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
//    cin >> t;

    for (int i = 1; i <= t; ++i) {
        //cout<<"Case #"<<i<<": ";
        solve(t);
    }

    return 0;
}