#include <stdio.h>
#include <algorithm>

using namespace std;

const int MN = 500005;

int N;
int T[MN];

int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);

     scanf("%d",&N);

     for (int i = 1;i <= N;i++)
         scanf("%d",&T[i]);

     sort(T + 1,T + N + 1);

     for (int i = 1;i <= N;i++)
         printf("%d ",T[i]);

   return 0;
}