#include <vector>
#include <unordered_set>
#include <iostream>

using ll = long long;
using namespace std;

int main()
{
    ll i, j, k, N;

    cin >> N;

    vector<ll> z(N + 1);

    for(i = 1; i <= N; i++)
        cin >> z[i];

    vector<ll> a(N + 1);
    a[1] = 1;

    vector<unordered_set<ll>> bads(N + 2);

    i = 2;

    while(i <= N)
    {
        if(z[i])
        {
            j = i;
            k = i + z[i];

            for(;i < k && (i == j || !z[i]); i++)
                a[i] = a[i - j + 1];

            if(a[k - j + 1] > 1)
                bads[k].insert(a[k - j + 1]);
        }
        else
        {
            a[i] = 2;

            while(bads[i].find(a[i]) != bads[i].end())
                a[i]++;

            i++;
        }
    }

    for(i = 1; i <= N; i++)
        cout << a[i] << ' ';

    cout << endl;

    return 0;
}