#include <iostream>
#include <algorithm>
using namespace std;
struct student{
    int a;
    int b;
};
bool cmp(student a,student b){
    return a.a<b.a;
};
int main(){
    int n,i;
    cin >> n;
    student a[n];
    for (i=0;i<n;i++){
        cin >> a[i].a;
        a[i].b=i+1;
    }
    sort(a,a+n,cmp);
    for (i=0;i<n-1;i++)
        cout << a[i].b << " ";
    cout << a[n-1].b << endl;
    return 0;
}
