#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <algorithm>
#include <list>
#include <ctime>

using namespace std;
using ll = long long int;

ll inf = 1e9+7;

void test(vector<int>& v, vector<int>& ans){
    int n = v.size();
    int ctr = n;
    vector<vector<int>> g(n);
    ans.resize(n,0);
    for(int i = 0; i < n; ++i){
        if(v[i] == -1){
            ans[i] = ctr--;
        }
        else{
            g[v[i] - 1].push_back(i);
        }
    }
    int i = n - 1;
    while(i >= 0){
        for(auto j : g[i]){
            ans[j] = ctr--;
        }
        --i;
    }
}

vector<int> kodol(vector<int>& v){
    vector<int> ret;
    for(int i = 0; i < v.size(); ++i){
        int ptr = i + 1;
        while(ptr < v.size() && v[ptr] < v[i]) ++ptr;
        if(ptr == v.size()) ret.push_back(-1);
        else ret.push_back(ptr + 1);
    }
    return ret;
}

int main(){
    int n;
    cin >> n;
    vector<int> v(n);
    vector<int> ans(n);
    for(auto& i : v){
        cin >> i;
    }
    test(v,ans);
    for(auto i : ans)
        cout << i << " ";
    cout << endl;
    /*int n;
    cin >> n;
    vector<int> v(n);
    for(int i = 0; i < n; ++i){
        v[i] = i + 1;
    }
    while(next_permutation(v.begin(), v.end())){
        vector<int> kod = kodol(v);
        vector<int> dekodolt(n);
        test(kod, dekodolt);
        vector<int> chk = kodol(dekodolt);
        if(chk != kod){
            cerr << "v:" << endl;
            for(auto i : v)
                cerr << i << " ";
            cerr << endl;
            cerr << "kod:" << endl;
            for(auto i : kod)
                cerr << i << " ";
            cerr << endl;
            cerr << "dek:" << endl;
            for(auto i : dekodolt)
                cerr << i << " ";
            cerr << endl;
        }
    }*/
    return 0;
}