#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left;
    struct node *right;
}Node;
Node *root=NULL;
Node *create(int val){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=val;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
Node *queue[200];
    int front=0,rear=0;
Node *insert(Node *root,int val){
    if(root==NULL){
        return create(val);
    }
    
    queue[rear++]=root;
    while(front<rear){
        Node *temp=queue[front++];
        if(temp->left==NULL){
            return temp->left=create(val);
        }
        else{
            queue[rear++]=temp->left;
        }
        if(temp->right==NULL){
            return temp->right=create(val);
        }
        else{
            queue[rear++]=temp->right;
        }
    }
}

void print(Node *root){
    if(root==NULL)
        return;
    queue[++rear]=root;
    while(front<rear){
        Node *temp=queue[front++];
        printf("%d ",temp->data);
        if(temp->left)
            queue[rear++]=temp->left;
        if(temp->right)
            queue[rear++]=temp->right;
    }
        
}
int main(){
    int n;
    scanf("%d",&n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<n;i++){
        int x;
        scanf("%d",&x);
        insert(&root,x);
    }
    int y;
    scanf("%d",&y);
    insert(&root,y);
    print(root);
    return 0;
}