#include <cstdio>
#include <ctype.h>
#include <algorithm>
using namespace std;
#define maxn 500000*13

char buff[maxn];
int n;
int v[maxn/13];
char x;
void read(int &a)
{
    while(!isdigit(x = getchar()));
    a = x-48;
    while(isdigit(x = getchar()))
        a = a * 10 + x - 48;
}

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

    setvbuf(stdin,buff,_IOFBF,maxn);

    read(n);
    int i;
    for(i=1;i<=n;++i)
        read(v[i]);

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

    for(i=1;i<=n;++i)
        printf("%d ",v[i]);printf("\n");

    return 0;
}