#include<stdio.h>
#include<stdlib.h>

typedef struct node{
    int data;
    struct node *right,*left;
}node;
node *root=NULL;

node *create(int num){
    node *newnode=(node*)malloc(1*sizeof(node));
    newnode->data=num;
    newnode->right=NULL;
    newnode->left=NULL;
    return newnode;
}

node *ins(node *root,int num){
    if(root==NUL){
        return create(num);
    }
    if(num<root->data){
        root->left=ins(root->left,num);
    }
    else if(num>root->data){
        root->right=ins(root->right,num);
    }
    return root;
}

void inoder(node *root){
    if(root!=NULL){
    inorder(toot->left);
    inorder(toot->right);
    printf("%d ",root->data);
    }
}

int main(){
    int s,n,i,val;
    scanf("%d",&s;);
    if(s<0){
        printf("Invalid input");
        return 0;
    }
    scanf("%d",val);
    root=ins(root,num);
    if(val<0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<s;i++){
        scanf("%d",&n);
        root=ins(root,num);
    }
    inorder(root);
    return 0;
    
    
}