#include <algorithm>
#include <cstdio>
#include <vector>

using namespace std;

int main() {
  int n;
  scanf("%d", &n);
  vector<int> v(n);
  for(auto& x: v) scanf("%d", &x);
  sort(v.rbegin(), v.rend());
  int ret = 0;
  int64_t last = 0;
  int64_t curr = 0;
  for(int i = 0; i < n; i++) {
    if(curr + v[i] >= last) {
      last += curr + v[i];
      ret = i+1;
      curr = 0;
    }
    else curr += v[i];
  }
  printf("%d\n", ret);
}