#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007ll
void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0<u; u >>= 1, k++)s = (s << 1) | (u & 1); for (; 0<k--; s >>= 1)cout << (s & 1); } }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

namespace {
    std::chrono::system_clock::time_point t;
    void tic() { t = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); }
    std::chrono::system_clock::time_point tle = TIME;
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
}

template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

class Graph {
public:
    class adjacent {
    public:
        Graph& g;
        int id;
        adjacent(Graph& g, int id) :g(g), id(id) {}

        class iterator {
        public:
            adjacent& ref;
            int pointer;

            iterator(adjacent& ref, int p = 0) :ref(ref), pointer(p) {}
            iterator& operator ++() {
                ++pointer; return *this;
            }
            const int& operator*() const {
                int n1 = ref.g.vertex_to[ref.id].size();
                return pointer<n1 ? ref.g.vertex_to[ref.id][pointer] : ref.g.vertex_from[ref.id][pointer - n1];
            }
            int& operator*() {
                int n1 = ref.g.vertex_to[ref.id].size();
                return pointer<n1 ? ref.g.vertex_to[ref.id][pointer] : ref.g.vertex_from[ref.id][pointer - n1];
            }
            bool operator!=(const iterator& it) const {
                return it.pointer != pointer;
            }
        };
        iterator begin() { return iterator(*this, 0); }
        iterator end() { return iterator(*this, g.vertex_to[id].size() + g.vertex_from[id].size()); }
    };
    size_t n;
    vector<vector<int>> vertex_to;
    vector<vector<int>> vertex_from;

    Graph(size_t n) :n(n), vertex_to(n), vertex_from(n) {}

    void connect(int from, int to) {
        vertex_to[from].emplace_back(to);
        vertex_from[to].emplace_back(from);
    }
    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
        vertex_from.resize(_n);
    }
    // for (auto to : g.vertex_adjacent(vertex_id)) な感じで使う
    adjacent vertex_adjacent(int idx) {
        return adjacent(*this, idx);
    }

    size_t degree(int v) {
        return vertex_to[v].size() + vertex_from[v].size();
    }

    void reverse_direction() {
        vertex_from.swap(vertex_to);
    }
};

int width, height;
int m, n, c, kei;

ll aa[100010];

int main() {
    int i, j, k;
    int x, y, a, b;

    cin >> n;

    //Graph graph(n);

    for (i = 0; i < n; ++i) {
        scanf("%d",aa + i);
    }

    sort(aa, aa + n);

    ll sum = aa[0];
    int low = 0;
    for (i = 1; i < n; ++i) {
        if (sum*2 < aa[i]) {
            low = i;
        }
        sum += aa[i];
    }

    cout << (n - low) << endl;



    return 0;
}

Measured memory_bytes: 1024