#include <algorithm>
#define N 500001
using namespace std;

int p[N],v[N];
int f(int i,int j)
{return v[p[i]]<v[p[j]];}

int main ()
{int i,n;
 freopen("algsort.in","r",stdin);
 freopen("algsort.out","w",stdout);

 scanf("%d",&n);
 for (i=0;i<n;i++)
 {scanf("%d",&v[i]);
  p[i]=i;
 }
 sort(p,p+n,f);
 for (i=0;i<n;i++)
 {printf("%d ",v[p[i]]);
 }
 
 return 0;
}