#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int n,x[500001];

int cmp(const void*a,const void*b)
{
    return *(int *)a-*(int *)b;
}
int main()
{
    int i;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    cin>>n;
    for (i=1;i<=n;i++)
        cin>>x[i];
    qsort(x+1,n,sizeof(x[1]),cmp);
    for (i=1;i<=n;i++)
        cout <<x[i]<<" ";
    cout<<"\n";
    return 0;
}