// editor1
#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode{
    int data;
    struct TreeNode *left;
    struct TreeNode *right;
}Node;
Node*root=NULL;
Node*create(int num){
    Node*newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=newnode->right=NULL;
    return newnode;
}
Node*insertBST(Node*root,int num){
    if(root==NULL)
    return create(num);
    if(root->data<num)
    root->left->insertBST(root->left,num);
    else
    root->right->insertBST(root->right,num);
    return root;
}
 void sorterdorder(Node*root){
        if(root!=NULL){
            sorterdorder(root->left);
            printf("%d",root->data);
            sorterdorder(root->right);
        }
int main(){
    int size,val,num,i;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
    }
    for(i=0;i<size;i++){
        scanf("%d",&num);
        root=insertBST(root,num);
     }
    root=insertBST(root,val);
   
    }
    sortedorder(root);
    return 0;
}