#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *left;
    struct node *right;
}Node;
Node*root=NULL;
Node*newNode(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);
    else if(num>root->data){
    root->right=insert(root->right,num);
    }
    return root;
}
void inOrder(Node *next)
{
    if(root!=NULL)
    inOrder(root->left);
    printf("%d",root->left);
    inOrder(root->right);
    }
}
    
int main()
{
    int i,num,size;
        scanf("%d",&n);
        if(n<0)
        {
            printf("Invalid input");
            return 0;
        }
        for(i=0;i<=0;i++)
        {
            scanf("%d",&num);
            root->insert(root,num);
            
        }
        inOrder(root);
        return 0;
}