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

vector<vector<int>> graph;
vector<int> megoldas;
vector<int> mutat;
vector<bool> volt;

void bejar(int current) {
    if (volt[current]) return;
    
    volt[current] = true;
    
    for (int szom : graph[current]) {
        if (megoldas[szom] < megoldas[current]+1) {
            megoldas[szom] = megoldas[current]+1;
        }
        mutat[szom]--;
    }
}

int main() {
    int n;
    cin >> n;
    
    graph.resize(n);
    megoldas.assign(n, 0);
    mutat.assign(n, 0);
    volt.assign(n, false);
    
    for (int i = 0; n > i; i++) {
        int temp;
        cin >> temp;
        
        if (temp != -1) {
            temp--;
            
            mutat[temp]++;
            graph[i].push_back(temp);
            
            for (int j = i+1; temp > j; j++) {
                mutat[i]++;
                graph[j].push_back(i);
            }
        } else {
            for (int j = i+1; n > j; j++) {
                graph[j].push_back(i);
                mutat[i]++;
            }
        }
    }
    
    return 1;
    
    int counter = 0;
    while (counter < n) {
        for (int i = 0; n > i; i++) {
            if (mutat[i] == 0 && !volt[i]) {
                bejar(i);
                counter++;
            }
        }   
    }
    
    // megoldas, index
    vector<pair<int, int>> sor;
    
    for (int i = 0; n > i; i++) {
        sor.push_back({megoldas[i], i});
    }
    
    sort(sor.begin(), sor.end());
    
    vector<int> ans(n, 0);
    
    int next = 1;
    for (int i = 0; n > i; i++) {
        int index = sor[i].second;
        
        ans[index] = next;
        
        next++;
    }
    
    for (int a : ans) {
        cout << a << " ";
    }
    cout << endl;
    
	return 0;
}