#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

struct Vals
{
    int val, index;

    Vals(int val, int index):
        val(val), index(index)
    {
    }
};

struct ValCompare
{
    bool operator()(Vals a, Vals b)
    {
        return a.val > b.val;
    }
};

int n;
priority_queue <Vals, vector<Vals>, ValCompare> v;

int main()
{
    int x, i;

    f >> n;
    for(i=1; i<=n; ++i){
        f >> x;
        v.emplace(x, i);
    }

    while(!v.empty()){
        g << v.top().val << ' ';
        v.pop();
    }

    return 0;
}