#include <cstdio>
#include <vector>
#include <algorithm>

struct Pozitie
{
        bool operator<(const Pozitie& other) const
        {
                return pos < other.pos;
        }

        int pos;
        int nr_ordine;
};

int main()
{
        std::freopen("schi.in", "r", stdin);
        std::freopen("schi.out", "w", stdout);

        int N;
        std::scanf("%d", &N);

        std::vector<Pozitie> vec;
        vec.resize(N);
        for(int i = 0; i < N; ++i)
        {
                int pos;
                std::scanf("%d", &pos);

                vec[i] = {pos, i + 1};
                for(int j = i - 1; j >= 0; --j)
                {
                        vec[j].pos += (vec[j].pos >= pos);
                }
        }

        std::sort(vec.begin(), vec.end());

        for(const auto& c : vec)
        {
                std::printf("%d\n", c.nr_ordine);
        }
}