#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);
    }
    else if(num<root->data){
        root->left=insert(root->left,num);
    }
    else if(num>root->data){
        root->right=insert(root->right,num);
    }
    return root;
}
Node *preorder(Node *root){
    if(root!=NULL){
        printf("%d ",root->data);
        root->left=preorder(root->left);
        root->right=preorder(root->right);
        
        
    }
    
}
int main(){
    int size,num,ind,x;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return;
    }
    for(ind=0;ind<size;ind++){
        scanf("%d",&num);
        root=insert(root,num);
        
    }
    scanf("%d ",&x);
    num = x;
    root=insert(root,num);
    preorder(root);
    return 0;
    
}