#include <cstdio>

const char infile[] = "algsort.in";
const char outfile[] = "algsort.out";

struct btree_node{
	int data;
	btree_node *left, *right;
}	*R;

int N, val;

void insert( btree_node *&node, int val ){
	if( node == NULL ){
		node = new btree_node;
		node -> left = NULL;
		node -> right = NULL;
		node -> data = val;
		return ;
	}

	if( val < node -> data )
		insert( node -> left, val );
	else
		insert( node -> right, val );
}

void write_in_order( btree_node *node ){
	if( node != NULL )
	{
		write_in_order( node -> left );
		printf( "%d ", node -> data );
		write_in_order( node -> right );
	}
}

int main(){
	freopen( infile, "r", stdin );
	freopen( outfile, "w", stdout );

	scanf( "%d", &N );
	for( ; N; N-- ){
		scanf( "%d", &val );
		insert( R, val );
	}

	write_in_order( R );
	fclose( stdin );
	fclose( stdout );
	return 0;
}