#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");
long long n,A[500010],i,ok,aux;
void sort1();
int main()
{

    fin>>n;
    for(i=1;i<=n;i++)
    fin>>A[i];
    //sort1();
    sort(A+1,A+1+n);
    for(i=1;i<=n;i++)if(i!=1) fout<<' '<<A[i]; else fout<<A[i];
    fout<<'\n';
    return 0;
}

void sort1()
{
ok=1;
    while(ok==1)
          {
          ok=0;
          for(i=1;i<n;i++)
          if(A[i]>A[i+1]) {ok=1; aux=A[i];A[i]=A[i+1];A[i+1]=aux;}
          }
}