#include<stdio.h>
#define N 8001
struct	Node{
	int s,t,nlen;
}node[2*N];
void creatTree(int s,int l,int r)
{
	node[s].s=l,node[s].t=r;
	node[s].nlen=r-l+1;
	if(r>l)	{
		int m=(r+l)>>1;
		creatTree(2*s,l,m);
		creatTree(2*s+1,m+1,r);
	}
}
int search(int pos,int s)
{
	node[s].nlen--;
	if(node[s].s!=node[s].t)	{
		if(pos<=node[2*s].nlen)	return search(pos,2*s);
		else	return search(pos-node[2*s].nlen,2*s+1);
	}
	return node[s].s;
}

int main()
{
//	freopen("data.txt","r",stdin);
	int n,i,a[N],b[N];
	scanf("%d",&n);
	a[1]=0;
	for(i=2;i<=n;i++)
		scanf("%d",&a[i]);
	creatTree(1,1,n);
	for(i=n;i>=1;i--)
		b[i]=search(a[i]+1,1);;
	for(i=1;i<=n;i++)
		printf("%d\n",b[i]);
	return 0;
}