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

vector<int> solution(int N, vector<int> stages) {
    
   	map<int, float> tempFailRate;
	vector<float> tempVal;

	for (int i = 1; i <= N; i++) {
		int nonClearPerson = 0;
		int reachedPerson = 0;
		for (vector<int>::size_type j = 0; j < stages.size(); j++) {
			if (stages[j] > i) {
				reachedPerson++;
			}
			else if (stages[j] == i) {
				reachedPerson++;
				nonClearPerson++;
			}
		}
		if (reachedPerson == 0) {
			pair<int, float> pair(i, 0.0f);
			tempFailRate.insert(pair);
			tempVal.push_back(0.0f);
		}
		else {
			pair<int, float> pair(i, (float)nonClearPerson / reachedPerson);
			tempFailRate.insert(pair);
			tempVal.push_back((float)nonClearPerson / reachedPerson);
		}
	}
	sort(tempVal.begin(), tempVal.end(), greater<float>());
	vector<int> answer;
	for (vector<int>::size_type i = 0; i < tempVal.size(); i++) {
		for (map<int, float>::size_type j = 1; j <= tempFailRate.size(); j++) {
			if (tempVal[i] == tempFailRate[j]) {
				if(find(answer.begin(),answer.end(),j)==answer.end())
					answer.push_back(j);
			}
		}
	}

	return answer;
}