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