Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Mike and code of a permutation

time limit per test

4 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputMike has discovered a new way to encode permutations. If he has a permutation *P* = [*p*_{1}, *p*_{2}, ..., *p*_{n}], he will encode it in the following way:

Denote by *A* = [*a*_{1}, *a*_{2}, ..., *a*_{n}] a sequence of length *n* which will represent the code of the permutation. For each *i* from 1 to *n* sequentially, he will choose the smallest unmarked *j* (1 ≤ *j* ≤ *n*) such that *p*_{i} < *p*_{j} and will assign to *a*_{i} the number *j* (in other words he performs *a*_{i} = *j*) and will mark *j*. If there is no such *j*, he'll assign to *a*_{i} the number - 1 (he performs *a*_{i} = - 1).

Mike forgot his original permutation but he remembers its code. Your task is simple: find any permutation such that its code is the same as the code of Mike's original permutation.

You may assume that there will always be at least one valid permutation.

Input

The first line contains single integer *n* (1 ≤ *n* ≤ 500 000) — length of permutation.

The second line contains *n* space-separated integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ *n* or *a*_{i} = - 1) — the code of Mike's permutation.

You may assume that all positive values from *A* are different.

Output

In first and only line print *n* numbers *p*_{1}, *p*_{2}, ..., *p*_{n} (1 ≤ *p*_{i} ≤ *n*) — a permutation *P* which has the same code as the given one. Note that numbers in permutation are distinct.

Examples

Input

6

2 -1 1 5 -1 4

Output

2 6 1 4 5 3

Input

8

2 -1 4 -1 6 -1 8 -1

Output

1 8 2 7 3 6 4 5

Note

For the permutation from the first example:

*i* = 1, the smallest *j* is 2 because *p*_{2} = 6 > *p*_{1} = 2.

*i* = 2, there is no *j* because *p*_{2} = 6 is the greatest element in the permutation.

*i* = 3, the smallest *j* is 1 because *p*_{1} = 2 > *p*_{3} = 1.

*i* = 4, the smallest *j* is 5 (2 was already marked) because *p*_{5} = 5 > *p*_{4} = 4.

*i* = 5, there is no *j* because 2 is already marked.

*i* = 6, the smallest *j* is 4 because *p*_{4} = 4 > *p*_{6} = 3.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/19/2019 23:03:14 (d2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|