#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &x, T y) {
  return x > y ? x = y, 1 : 0;
}
template <typename T>
inline bool chkmax(T &x, T y) {
  return x < y ? x = y, 1 : 0;
}
template <typename T>
inline void read(T &x) {
  char ch = getchar();
  int f = 1;
  x = 0;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  x *= f;
}
int n, a[500050], b[500050], vis[500050], ord[500050], tot;
vector<int> ans;
pair<int, int> maxx[500050 << 2];
void build(int u, int l, int r) {
  if (l == r) return (void)(maxx[u] = make_pair(b[l], l));
  build(u << 1, l, ((l + r) >> 1)), build(u << 1 | 1, ((l + r) >> 1) + 1, r);
  maxx[u] = max(maxx[u << 1], maxx[u << 1 | 1]);
}
void reset(int u, int l, int r, int x) {
  if (l == r) return (void)(maxx[u] = make_pair(0, 0));
  if (x <= ((l + r) >> 1))
    reset(u << 1, l, ((l + r) >> 1), x);
  else
    reset(u << 1 | 1, ((l + r) >> 1) + 1, r, x);
  maxx[u] = max(maxx[u << 1], maxx[u << 1 | 1]);
}
pair<int, int> query(int u, int l, int r, int k) {
  if (l > k) return make_pair(0, 0);
  if (r <= k) return maxx[u];
  return max(query(u << 1, l, ((l + r) >> 1), k),
             query(u << 1 | 1, ((l + r) >> 1) + 1, r, k));
}
void dfs(int u) {
  vis[u] = 1, reset(1, 1, n, u);
  if (b[u] != n + 1 && !vis[b[u]]) dfs(b[u]);
  while (1) {
    pair<int, int> cur = query(1, 1, n, a[u] - 1);
    if (cur.first > u && !vis[cur.second])
      dfs(cur.second);
    else
      break;
  }
  ans.push_back(u);
}
int main() {
  read(n);
  for (register int i = 1; i <= n; ++i)
    read(a[i]), a[i] > 0 ? b[a[i]] = i : a[i] = n + 1;
  for (register int i = 1; i <= n; ++i)
    if (!b[i]) b[i] = n + 1;
  build(1, 1, n);
  for (register int i = 1; i <= n; ++i)
    if (!vis[i]) dfs(i);
  for (auto v : ans) ord[v] = ++tot;
  for (register int i = 1; i <= n; ++i) printf("%d ", ord[i]);
  return 0;
}
