#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const int maxN = 2e5 + 5;
const int MOD = 1e9 + 7;

vector<vector<int> > g(maxN);
vector<int> sorrend, mo;


int main() {

#pragma region
#ifndef ONLINE_JUDGE
   freopen("../input.txt", "r", stdin);
   freopen("../output.txt", "w", stdout);
#endif

   InTheNameOfGod;
#pragma endregion
    
    int n;
    cin >> n;
    vector<int> v(n), fugges(n, 0);
    mo.resize(n, -1);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }
    int curr = n;

    queue<int> sor;
    for(int i = 0; i < n; i++) {
        if(v[i] == -1) {
            mo[i] = curr--;
            sor.push(i+1);
        }
        else {
            g[v[i]].push_back(i+1);
            fugges[i+1]++;
        }
    }

    while(!sor.empty()) {
        int curr = sor.front();
		sor.pop();

		if(v[curr-1] != -1) sorrend.push_back(curr-1);
        for(int sz : g[curr]) {
            if(--fugges[sz] == 0) {
                sor.push(sz);
            }
        }  
    }
    reverse(sorrend.begin(), sorrend.end());
    for(int i = 0; i < sorrend.size(); i++) {
        mo[sorrend[i]] = i+1;
    }

    for(int a : mo) cout << a << ' ';

    return 0;
}