#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int n , i, x ;
vector < int > v;

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

    scanf("%d",&n);
    for ( ; n-- ; )
    {
        scanf("%d",&x);
        v.push_back(x);
    }
    sort(v.begin() , v.end());
    for ( vector < int > ::iterator i = v.begin(); i != v.end() ; i++ )
        printf( "%d ", (*i) ) ;

    return 0;
}