#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,v[500100];
FILE *f,*g;
int main(){
    f=fopen("algsort.in","r");
    g=fopen("algsort.out","w");
    fscanf(f,"%d",&n);
    for(i=1;i<=n;i++){
        fscanf(f,"%d",&v[i]);
    }
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++){
        fprintf(g,"%d ",v[i]);
    }
    fclose(f);
    fclose(g);
    return 0;
}