#include <bits/stdc++.h>

using namespace std;


vector<int> tops;
vector<bool> seen;
vector<vector<int>> v;

void dfs(int x){
    if (seen[x]) return;
    seen[x] = true;
    for (int i : v[x]) dfs(i);
    tops.push_back(x);
}


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

    v.assign(n+1, {});
    seen.assign(n+1, false);
    vector<int> s;
	int el = -1;
    s.push_back(0);

    for (int i = 1; i <= n; i++){
        int a; cin >> a;
		s.push_back(a);
        if (a == -1){
            if (el != -1){
				v[i].push_back(el);
			}
			el = i;
            continue;
        }
        v[i].push_back(a);
    }

	for (int i = 1; i <= n; i++){
		if (s[i] != -1){
			v[i].push_back(el);
		}
	}

    for (int i = 1; i <= n; i++) dfs(i);

    reverse(tops.begin(), tops.end());

    vector<int> asd(n+1);

    for (int i = 1; i <= n; i++) asd[tops[i]] = i;

    for (int i = 1; i <= n; i++) cout << asd[i]+1 << " "; // 2 3 5 4 1 

    return 0;


}