#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<bool> volt(maxN), elhagy(maxN);
vector<int> sorrend;

void dfs(int x)
{
	volt[x] = true;
	for (int sz : g[x]) {
		if (!volt[sz]) {
			dfs(sz);
		}
		else if (!elhagy[sz]) {
			cout << "IMPOSSIBLE" << endl;
			exit(0);
		}
	}
	sorrend.push_back(x);
	elhagy[x] = true;
}

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), mo(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }
    int curr = n;

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

    for (int i = 1; i <= n; i++) {
		if (!volt[i])
			dfs(i);
	}

    for(int i = 0; i < sorrend.size(); i++) {
        mo[sorrend[i]] = i+1;
    }

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

    return 0;
}