#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(sizeof(Node));
    
    newNode->left=NULL;
    newNode->data=num;
    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);
    }
    else if(num > root->data){
         root->right=insert(root->right,num);
    }
    return root;
}
void inorder(int root){
    if(root!= NULL)
    inorder(root->left);
    printf("%d",root->data);
    inorder(root->right);
}

int main(){
    int n,num;
    
    if(!scanf("%d",&n)||size<0){
        printf("Invalid input");
        return 0;
    }
    for(int itr=0;itr<=size;itr++){
        scanf("%d",&num);
        create (num);
    }
    inorder(root);
    return 0;
}