#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,ok,aux,x[500010];
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    cin>>n;
    for(i=1;i<=n;i++)cin>>x[i];
    //sortarea
    do
    {
        ok=1;
        for(i=1;i<n;i++)
            if(x[i]>x[i+1])
            {
                aux=x[i];
                x[i]=x[i+1];
                x[i+1]=aux;
                ok=0;

            }
    }while (ok==0);
    for(i=1;i<=n;i++)cout<<x[i]<<' ';
    return 0;
}