//It is made by ljh2000

#include <iostream>

#include <cstdlib>

#include <cstring>

#include <cstdio>

#include <cmath>

#include <algorithm>

#include <ctime>

#include <vector>

#include <queue>

#include <map>

#include <set>

#include <string>

using namespace std;

typedef long long LL;

const int MAXN = 200011;

int n,f[MAXN],a[MAXN],cnt;

int ecnt,first[MAXN],to[MAXN],next[MAXN];

inline void link(int x,int y){

	next[++ecnt]=first[x]; first[x]=ecnt; to[ecnt]=y;

}

inline int getint(){

    int w=0,q=0; char c=getchar(); while((c<'0'||c>'9') && c!='-') c=getchar();

    if(c=='-') q=1,c=getchar(); while (c>='0'&&c<='9') w=w*10+c-'0',c=getchar(); return q?-w:w;

}

inline void work(){

	n=getint(); for(int i=1;i<=n;i++) a[i]=getint(),link(a[i],i);

	cnt=0;

	for(int i=1;i<=n;i++) {

		if(first[i]==0) break;

		for(int j=first[i];j;j=next[j]) {

			a[to[j]]=++cnt;

		}

	}

	for(int i=1;i<=n;i++) printf("%d ",a[i]);

}

int main()

{

    work();

    return 0;

}