/*

     比C还水。。。

 */

 #include <cstdio>

 #include <algorithm>

 #include <cstring>

 #include <cmath>

 #include <iostream>

 using namespace std;

 typedef long long ll;

 const int MAXN = 1e5 + ;

 const int INF = 0x3f3f3f3f;

 ll a[MAXN];

 int main(void)        //Codeforces Round #303 (Div. 2) D. Queue

 {

     //freopen ("D.in", "r", stdin);

     int n;

     while (scanf ("%d", &n) == )

     {

         for (int i=; i<=n; ++i)    scanf ("%I64d", &a[i]);

         sort (a+, a++n);

         ll sum = ;    int cnt = ;    a[] = ;

         for (int i=; i<=n; ++i)

         {

             if (sum <= a[i])

             {

                 sum += a[i];    cnt++;

             }

         }

         printf ("%d\n", cnt);

     }

     return ;

 }