#include<bits/stdc++.h>
using namespace std;
int n, a[100010], b[100010], len;
double ans, maxx;
int main() {
	cin >> n;
	for(int i = 1;i <= n;i ++) cin >> a[i];
	sort(a + 1,a + n + 1);
	for(int i = 1;i <= n;i ++) b[i] = b[i - 1] + a[i];
	for(int i = 1;i <= n - 2;i ++) {
		ans = (b[n] - b[i + 1]) / (n - i) * 1.0;
		maxx = max(maxx,ans);
	}
	for(int i = 1;i <= n - 2;i ++) {
		ans = (b[n] - b[i + 1]) / (n - i) * 1.0;
		if(ans == maxx) cout << i << endl;
	}
	return 0;
}