#include<stdio.h>
#include<algorithm>
using namespace std;
FILE*fin,*fout;
bool cmp(int a,int b){
if(a<b){return 1;}
return 0;
}

int n, v[500001],i;
int main(){

fin=fopen("algsort.in","r");
fout=fopen("algsort.out","w");
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%d",&v[i]);
}
sort(v+1,v+n+1,cmp);
for(i=1;i<=n;i++){
fprintf(fout,"%d ", v[i]);
}
return 0;
}