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

int n;
long long so[100001],pos[100001];

bool Check(int i,int j)
{
    if(so[i]!=so[j])
    {
        return so[i]<so[j];
    }
    else
    {
        return i<j;
    }
}

main()
{
  freopen("stable.inp","r",stdin);
  freopen("stable.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>so[i];
        pos[i]=i;
    }
    sort(pos+1,pos+1+n,Check);

    for(int i=1;i<=n;i++)
    {
        cout<<pos[i]<<" ";
    }
}