#include <bits/stdc++.h>
using namespace std;
long long a, b[1001], c, cnt1, cnt2, d, n, m;
string s;
int main() {
  cin >> a;
  if (a == 1) {
    cout << 1;
    return 0;
  }
  for (int i = 1; i <= a; i++) {
    cin >> b[i];
    c += b[i];
  }
  sort(b + 1, b + a + 1);
  reverse(b + 1, b + a + 1);
  for (int i = 1; i <= a; i++) {
    d = (c - b[i]);
    n += c - d;
    cnt1++;
    if (n > d) {
      cout << cnt1;
      return 0;
    }
    c = d;
  }
}
