#include <stdio.h>
#include <algorithm>
using namespace std;
long n,i,j,l,v[500003];
char ch[5500000];
int main(){
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%ld\n",&n);
    gets(ch);l=strlen(ch);ch[l]=' ';
    j=0;
    for (i=1;i<=n;++i){
        int nr=0;
        while (ch[j]!=' '){
          nr=nr*10+ch[j]-'0';
          j++;
        }
        j++;
        v[i]=nr;
    }
    sort(v+1,v+n+1);
    for (i=1;i<=n;++i)printf("%ld ",v[i]);
return 0;
}