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

ifstream fin("schi.in");
ofstream fout("schi.out");

int candidateRank[30001], superiorCandidatesCounter[30001];

set<pair<int, int>> ans;

int main() {
    int n;
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> candidateRank[i];
        superiorCandidatesCounter[i] = candidateRank[i] - 1;
        for (int j = 1; j < i; ++j) {
            if (candidateRank[j] >= candidateRank[i]) {
                ++superiorCandidatesCounter[j];
                ++candidateRank[j];
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        ans.insert({superiorCandidatesCounter[i], i});
    }
    for (set<pair<int, int>>::iterator it = ans.begin(); it != ans.end(); ++it) {
        fout << it->second << '\n';
    }
    return 0;
}