/* Sortare cu sort()*/ 

#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;

int n, v[500001],i,ind[500001];

bool compare(int x, int y)
{return(v[x]<v[y]);}

int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1; i<=n; i++)
  {scanf("%d",&v[i]);
   ind[i]=i;}
sort(ind+1,ind+n+1,compare);  

/*printf("Vectorul indicilor: ");
for(i=1; i<=n; i++)
  printf("%d ",ind[i]);
printf("\n"); 
printf("Vectorul valorilor: "); */
for(i=1; i<=n; i++)
  printf("%d ",v[ind[i]]);
//printf("\n");
return 0;
}