#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <algorithm>
#include <list>
using namespace std;
using ll = long long int;

ll inf = 1e9+7;

int main(){
    int n;
    cin >> n;
    vector<int> v(n);
    vector<int> ans(n);
    int ctr = n;
    for(int i = 0; i < n; ++i){
        cin >> v[i];
        if(v[i] == -1){
            ans[i] = ctr--;
        }
    }
    int i = n - 1;
    while(i >= 0){
        if(v[i] != -1){
            int ptr = i;
            while(ptr >= 0 && v[ptr] == v[i]){
                --ptr;
            }
            if(v[ptr] != v[i]) ++ptr;
            int newi = ptr - 1;
            while(ptr <= i){
                ans[ptr] = ctr--;
                ++ptr;
            }
            i = newi;
        }
        else{
            --i;
        }
    }
    for(auto i : ans)
        cout << i << " ";
    return 0;
}