#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int N, sum = 0;
    cin >> N;
    vector<int> kovek(N, 0);
    for (int i = 0; i < N; i++) {
            cin >> kovek[i];
            sum += kovek[i];
    }
    int mean = sum / N;
    vector<int> kulonbsegek(N, 0);
    int count = 1;
    int negativok = 0;
    int pozitivok = 0;
    for (int i = 0; i < N; i++) {
            int kulonbseg = kovek[i] - mean;
            kulonbsegek[i] = kulonbseg;
            if (kulonbseg > 0) pozitivok += 1;
            if (kulonbseg < 0) negativok += 1;
    }
    cout << max(negativok, pozitivok) << endl;
    return 0;
}