Problem: Mike has discovered a new way to encode permutations. If he has a permutation P = [p1, p2, ..., pn], he will encode it in the following way:

Denote by A = [a1, a2, ..., an] 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 pi < pj and will assign to ai the number j (in other words he performs ai = j) and will mark j. If there is no such j, he'll assign to ai the number  - 1 (he performs ai = - 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 a1, a2, ..., an (1 ≤ ai ≤ n or ai = - 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 p1, p2, ..., pn (1 ≤ pi ≤ 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 p2 = 6 > p1 = 2.

i = 2, there is no j because p2 = 6 is the greatest element in the permutation.

i = 3, the smallest j is 1 because p1 = 2 > p3 = 1.

i = 4, the smallest j is 5 (2 was already marked) because p5 = 5 > p4 = 4.

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

i = 6, the smallest j is 4 because p4 = 4 > p6 = 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500010;
int n, a[maxn], b[maxn], q[maxn], cnt, ww[maxn];
bool vis[maxn];
struct node {
  int ch[2];
  pair<int, int> ans;
} z[maxn * 2];
int treesize, rt;
void update(int a) { z[a].ans = max(z[z[a].ch[0]].ans, z[z[a].ch[1]].ans); }
void build(int &a, int l, int r) {
  a = ++treesize;
  if (l == r) {
    z[a].ans = make_pair(b[l], l);
    return;
  }
  int m = (l + r) >> 1;
  build(z[a].ch[0], l, m);
  build(z[a].ch[1], m + 1, r);
  update(a);
}
void del(int a, int l, int r, int p) {
  if (l == r) {
    z[a].ans = make_pair(0, 0);
    return;
  }
  int m = (l + r) >> 1;
  if (p <= m)
    del(z[a].ch[0], l, m, p);
  else
    del(z[a].ch[1], m + 1, r, p);
  update(a);
}
pair<int, int> query(int a, int l, int r, int ql, int qr) {
  if (ql > qr) return make_pair(0, 0);
  if (ql <= l && r <= qr) return z[a].ans;
  int m = (l + r) >> 1;
  pair<int, int> ans(0, 0);
  if (ql <= m) ans = max(ans, query(z[a].ch[0], l, m, ql, qr));
  if (qr > m) ans = max(ans, query(z[a].ch[1], m + 1, r, ql, qr));
  return ans;
}
void dfs(int a) {
  vis[a] = 1;
  del(rt, 1, n, a);
  if (b[a] <= n && !vis[b[a]]) dfs(b[a]);
  pair<int, int> tmp = query(rt, 1, n, 1, ::a[a] - 1);
  while (tmp.first > a) {
    dfs(tmp.second);
    tmp = query(rt, 1, n, 1, ::a[a] - 1);
  }
  q[cnt++] = a;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) b[i] = n + 1;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    if (a[i] > 0)
      b[a[i]] = i;
    else
      a[i] = n + 1;
  }
  build(rt, 1, n);
  for (int i = 1; i <= n; ++i)
    if (!vis[i]) dfs(i);
  for (int i = 0; i < n; ++i) ww[q[i]] = i + 1;
  for (int i = 1; i <= n; ++i) printf("%d ", ww[i]);
  return 0;
}