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

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

int main() {
    int n;
    fin >> n;
    vector<int> ans;
    for (int i = 1; i <= n; ++i) {
        int rankOccupied;
        fin >> rankOccupied;
        ans.insert(ans.begin() + rankOccupied - 1, i);
    }
    for (int i = 0; i < ans.size(); ++i) {
        fout << ans[i] << '\n';
    }
    return 0;
}

/*


*/