#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left,*right;
}node;
node*root=NULL;
node*create(int num){
    node*newnode=(node*)malloc(1*sizeof(node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
node*insert(node*root,int num){
    if(root==NULL){
        return create(num);
    }
    if(num<root->data){
        root->left=insert(root->left,num);
    }
    if(num>root->data){
        root->right=insert(root->right,num);
    }
    return root;
}
node*inorder(int num){
    if(root==NULL){
    inorder(root->left);
    printf("%d",root->data);
    inorder(root->right);
    }
}
int main(){
    int size,num,i;
    scanf("%d",&size);
    scanf("%d ",&x)
    if(size<0 || x<0){
        printf("Invalid input");
    }
    for(i=0;i<size;i++){
        insert(root,num);
    }
    root=insert(root,x);
    inorder(root);
    return 0;
}