#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, ans = 0;
  cin >> n;
  long long int ar[n];
  for (int i = 0; i < n; i++) {
    cin >> ar[i];
  }
  sort(ar, ar + n);
  long long int s = 0;
  for (int i = 0; i < n; i++) {
    if (s <= ar[i]) {
      s += ar[i];
      ans++;
    }
  }
  cout << ans;
}
int main() {
  int t = 1;
  while (t--) {
    solve();
    cout << '\n';
  }
  return 0;
}
