#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#define el '\n'
#define F first
#define S second

typedef long long ll;
typedef long double ld;
typedef __int128 bigInt;

using namespace std;

const int N = 4e5 + 5, INF = 1e9 + 5, mod = 1e9 + 7, LOG = 21, SQ = 500;

ll n, a[N], pre[N], ps[N];

void doWork() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) {
        pre[i] = a[i] + pre[i - 1];
    }
    for (int i = 1; i <= n; i++) {
        int s = 1, e = i, m, ans = i;

        while (s <= e) {
            m = (s + e) >> 1;
            ll sum = pre[i] - pre[m - 1];
            if (sum >= pre[n] - pre[i]) {
                ans = m;
                s = m + 1;
            }
            else {
                e = m - 1;
            }
        }


        ps[ans] += a[i];
        ps[i + 1] -= a[i];

        if (ans > 1) {
            ps[1] += -a[i];
            ps[ans] -= -a[i];
        }
    }

    ll cur = 0, ans = n;

    for (int i = 1; i <= n; i++) {
        cur += ps[i];

        if (cur < 0) {
            ans--;
        }
        else {
            break;
        }
    }

    cout << ans << el;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int tests = 1;
//    cin >> tests;
    for (int i = 1; i <= tests; i++) {
        doWork();
    }
}