#include <cstdio>
#include <algorithm>
using namespace std;
#define DIM 10000000
int n,i,v[500005];
char buff[DIM];
int poz=0;

void citeste(int &numar)
{
     numar = 0;
     while (buff[poz] < '0' || buff[poz] > '9')
          if (++poz == DIM)
               fread(buff,1,DIM,stdin),poz=0;
     while ('0'<=buff[poz] && buff[poz]<='9')
     {
          numar = numar*10 + buff[poz] - '0';
          if (++poz == DIM)
               fread(buff,1,DIM,stdin),poz=0;
     }
}
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    citeste(n);
    for(i=1;i<=n;i++)
        citeste(v[i]);
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++) printf("%d ",v[i]);
}