#include <cstdio>
using namespace std;

struct tree{
    int info;
    tree *st;
    tree *dr;
};

tree* nod( int k ){

    tree* nod_au = new tree;

    nod_au -> info = k;
    nod_au -> st = nod_au -> dr = NULL;

    return nod_au;

}

tree* adugare( tree* p, int k ){

    if( p == NULL )
        p = nod( k );
    else if( k <= p -> info )
        p -> st = adugare( p -> st, k );
    else
        p -> dr = adugare( p -> dr, k );


    return p;

}

void afisare( tree *p ){

    if( p == NULL ) return ;

    afisare( p -> st );
    printf("%d ",p->info);
    afisare( p -> dr );

}

int main()
{

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

    int n, i, j, s, t, d, k;
    tree* v = NULL;

    scanf("%d",&n);
    for( i = 1; i <= n; ++i ){
        scanf("%d",&k);
        v = adugare( v, k );
    }

    afisare( v );



    return 0;
}