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

const int MAXN = 200'001;

int a[MAXN], ans[MAXN], timer = 1;
bool vis[MAXN];
vector<int> g[MAXN];

void dfs(int u) {
	vis[u]=1;
	for (int v : g[u]) {
		if (!vis[v]) dfs(v);
	}
	ans[u] = timer++;
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int n; cin >> n;
	int x = n, last = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		if (a[i] == -1) {
			if (last) {
				g[i].emplace_back(last);
			}
			last = i;
		} else {
			g[i].emplace_back(a[i]);
		}
	}
	for (int i = 1; i <= n; i++) {
		if (a[i] != -1) g[i].emplace_back(last);
	}
	for (int i = 1; i <= n; i++) {
		if (!vis[i]) dfs(i);
	}
	for (int i = 1; i <= n; i++) {
		cout << n-ans[i]+1 << " ";
	}
	cout << "\n";
	return 0;
}