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

int main() {
	int n;
	cin>>n;
	vector<pair<int, int>> schi(n);
	for (int i=0; i<n; i++) {
		cin>>schi[i].first;
		schi[i].second=i;
	}
	vector<int> sol(n);
	sort(schi.begin(), schi.end());
	for (int i=0; i<n-1; i++) {
		int j=i+1;
		while (schi[i].first==schi[j].first) {
			sol.push_back(schi[i].first);
			j++;
		}
		reverse(sol.begin(), sol.end());
		cout<<schi[sol[i]].second;
	}
}