#include <iostream>
#include <cstdio>
#include <algorithm>
#define Nmax 500002
using namespace std;
int n , a[Nmax];
void swap(int &a,int &b)
{
    int aux=a;a=b;b=aux;
}
void sorting()
{
    bool bChanged = true;
    int j = 0 ;
    while(bChanged)
    {
        bChanged = false;
        ++j;
        for(int i = 0 ; i<n-j ; i ++)
        {
            if(a[i] > a[i+1])
            {
                swap(a[i] , a[i+1]);
                bChanged = true;
            }
        }
    }
}

void Read()
{
    freopen("algsort.in" , "r" , stdin);
    scanf("%d",&n);
    for(int i = 0 ; i < n ; i++)
        scanf("%d",&a[i]);
}
void Show()
{
     freopen("algsort.out" , "w" , stdout);
     for(int i = 0 ; i < n ; i++)
        printf("%d ",a[i]);
    printf("\n");
}
int main()
{
    Read();
    //sorting();
    sort(a,a+n);
    Show();
    return 0;
}