#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <cstdlib>
#include <ctime>
using namespace std ;

ifstream f ("algsort.in") ;
ofstream g ("algsort.out") ;

int n , v[500005] , tmp[500005] ;

void MergeSort(int st, int dr)
{
    if(st < dr)
    {
        int m = st + rand () % ( dr - st + 1 ) ;
        MergeSort(st , m);
        MergeSort(m + 1 , dr);
        //Interclasare
        int i = st, j = m + 1, k = 0;
        while( i <= m && j <= dr )
            if( v[i] < v[j])
                tmp[++k] = v[i++];
            else
                tmp[++k] = v[j++];
        while(i <= m)
            tmp[++k] = v[i++];
        while(j <= dr)
            tmp[++k] = v[j++];
        for(i = st , j = 1 ; i <= dr ; i ++ , j ++)
            v[i] = tmp[j];
    }
}

int main()
{
    srand (time(0)) ;
    f >> n ;
    for(int i = 0 ; i < n ; i ++)
        f >> v[i] ;
    MergeSort(0 , n - 1);
    for(int i = 0 ; i < n ; i ++)
        g << v[i] << " " ;
    return 0;
}