#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];




int main() {
    cin >> n;
    int sum = 0;
    for (int i = 1; i < n + 1; i++) scanf("%d", w + i), sum += w[i];
    sum /= n;
    for (int i = 1; i < n + 1; i++) res += w[i] >= sum + 100;
    printf("%lld\n", res);
    return 0;
}