#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin >> n;

    vector<int> alap(n);
    for(int &x : alap){
        cin >> x;
        x -= (x != -1);
    }

    int a = n;

    vector<int> ans(n);

    vector<vector<int>> csucsok(n, vector<int>());
    queue<int> bejar;
    vector<int> befok(n);
    for(int i = 0; i < n; i++){
        if(alap[i] == -1){

            ans[i] = a;
            a--;
            bejar.push(i);
        } else{
            for(int j = i + 1; j < alap[i]; j++){
                csucsok[i].push_back(j);
                befok[j]++;
            }

            csucsok[alap[i]].push_back(i);
            befok[i]++;
        }
    }

    vector<bool> bejart(n);

    while(!bejar.empty()){
        int akt = bejar.front();
        bejar.pop();

        if(bejart[akt]) continue;

        bejart[akt] = 1;

        for(int x : csucsok[akt]){
            if(bejart[x]) continue;

            befok[x]--;
            if(befok[x] == 0){
                bejar.push(x);
                ans[x] = a;
                a--;
            }
        }
    }


    for(int x : ans){
        cout << x << " ";
    }
    cout << "\n";
}