#include <cstdio>
int n,x,i,k,vector[10];

FILE * in = fopen("schi.in","rt");
FILE * out = fopen("schi.out","wt");

int found(int y);

int main()
{
	int e;
	
	fscanf(in,"%d",&n);
	
	for(i=1;i<=n;i++)
	{
		fscanf(in,"%d",&x);
		
		if(!found(x))		// daca nu exista cineva pe pozitia x in clasament
			vector[i] = x;
		else
			for(k=1;k<=i;k++)
			{
				if(vector[k] >= x)
					vector[k] = vector[k] + 1;
				vector[i] = x;
			}
		
		//for(e=1;e<=n;e++)
			//printf("%d ",vector[e]);
		//printf("\n");
	}
	
	e = 0;
	
	for(i=1;i<=n;i++)
	{
		e++;
		
		for(k=1;k<=n;k++)
			if(vector[k] == e)
				fprintf(out,"%d\n",k);
	}
	
//	for(i=1;i<=n;i++)
//		printf("%d ",vector[i]);
	
	return (0);
}

int found(int y)
{
	int e;
	
	for(e=1;e<=i;e++)
		if(vector[e] == x)
			return 1;
	
	return 0;
}