#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <iomanip>

#define rep(i,n) for(i=0; i<n; ++i)
#define inc_rep(i,a,n) for(i=a; i<=n; ++i)
#define dec_rep(i,n,a) for(i=n; i>=a; --i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
#define print_vec(v) for(auto it=v.begin();it!=v.end();++it)cout<<*it <<" ";cout<<endl
#define print_vec2d(v) for(int i=0;i<v.size();++i){for(int j=0;j<v[i].size();++j)cout<<v[i][j]<<" ";cout<<endl;}cout<<endl
using namespace std;
using lint = long long;


int main(void){
    int i, j;
    lint k, cnt=0, x, y;
    lint p, q, n, m;
    string s;
    in(n);
    map<int, int> d;
    rep(i,n){
        int a;
        in(a);
        if(i==0) x=a;
        d[a]=i+1;
    }
    dec_rep(i, x-1, 1){
        if(d[i]==0){
            d[i]=d[i+1];
        }
    }
    rep(i,x){
        cout << d[i+1];
        if(i!=x-1) cout << " ";
    }
    cout << endl;

    return 0;
}