#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
const size_t b = 1<<20;
struct R{R();R& operator>>(int &);char *B,*E,*p;void L();};
int n,x[N];
int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);
    R f;
    f >> n;
    for(int i=0;i<n;i++)f>>x[i];
    sort(x,x+n);
    for(int i=0;i<n;i++)printf("%d ",x[i]);
    return 0;
}
R::R(){B=new char[b+10];E=B+b;L();}
R& R::operator>>(int &x){while (*p<'0'||*p>'9') if(++p==E)L();x=0;while('0'<=*p&&*p<='9'){x=10*x+*p-'0'; if(++p==E)L();}return *this;}
void R::L() {memset(B,0,b);fread(B,1,b,stdin);p=B;}