cowAteHW_tonfai

#include <bits/stdc++.h>
using namespace std;

int main(){
	ifstream fin("homework.in");
	ofstream fout("homework.out");

	int N; fin >> N;
	queue<int> scores;
	vector<int> scoresV(N);
	queue<int> mins;
	int sum = 0;
	for(int i = 0; i<N; i++){
		fin >> scoresV[i];
		sum += scoresV[i];

		scores.push(scoresV[i]);
	}
	vector<int> sortedV = scoresV;
	sort(sortedV.begin(), sortedV.end());
	for(int i = 0; i<N; i++){
		mins.push(sortedV[i]);
	}
	//cout << "sums: " << sum << endl;

	double mx = 0;
	int ans = 0;
	for(int i = 0; i<N-1; i++){
		int num = N-i-1;

		//cout << "sum: " << sum << endl;
		//cout << "scores.front(): " << scores.front() << endl;
		//if(i != 0){
			//sum -= scores.front();
		//}


		int finalsum = sum - mins.front();


		//cout << "mins.front(): " << mins.front() << endl;
		//cout << "final sum: " << finalsum << endl;

		//if(scores.front() == mins.front()){
			//mins.pop();
		//}
		//scores.pop();
		double avg = (double)finalsum/(double)num;
		//cout << "avg: " << avg << endl;
		if(avg > mx){
			if (mx != 0){
				ans = i;
			}
			//cout << "at i: " << i << ", avg: " << avg << " is bigger than mx: " << mx << ", ans: " << ans << endl;
			mx = avg;

		}
		if(scores.front() == mins.front()){
			mins.pop();
		}
		sum -= scores.front();
		scores.pop();
		//if(i != 0){
			//sum -= scores.front();
		//}
		//mx = max(mx, avg);
	}
	fout << ans << endl;
}