#include<stdio.h>
#include<algorithm>
using namespace std;
long int n,i,j,aux,v[500001];
FILE *f,*g;
int main(){
    f=fopen("algsort.in","r");
    g=fopen("algsort.out","w");
    fscanf(f,"%ld",&n);
    for(i=1;i<=n;i++){
        fscanf(f,"%ld",&v[i]);
    }

//    sort(v+1,v+n+1);

    for(i=1;i<=n-1;i++){
        for(j=i+1;j<=n;j++){
            if(v[i]>v[j]){
                aux=v[i];
                v[i]=v[j];
                v[j]=aux;
            }
        }
    }

    for(i=1;i<=n;i++){
        fprintf(g,"%ld ",v[i]);
    }

    fclose(f);
    fclose(g);
    return 0;
}