#include <cstdio>
#include <algorithm>

using namespace std;
long long v[500001];
int main()
{
    freopen ("algsort.in" , "r" , stdin);
    freopen ("algsort.out" , "w" , stdout);
    long long n;
    scanf ("%lld" , &n );
    for ( int i = 1 ; i <= n ; ++i )
        scanf ("%lld" , &v[i] );
    sort (v+1 , v+n+1);
    for ( int i = 1 ; i <= n ; ++i )
    {   printf ("%lld" , v[i]);
        printf (" ");
    }
    return 0;
}