// editor1

#include<stdio.h>
#include<stdlib.h>

typedef struct Node{
    int data;
    struct Node *left, *right;
}Node;

Node *createNode(int data){
    Node *newNode=(Node*)malloc(sizeof(Node));
    newNode->data=data;
    newNode->left=newNode->right=NULL;
    return newNode;
}

Node *addNode(Node *node, int data){
    if(node==NULL)return createNode(data);
    if(data<node->data){
        node->left=addNode(node->left, data);
    }
    else{
        node->right=addNode(node->right, data);
    }
    return node;
}

Node *minNode(Node *node){
    while(node->left!=NULL){
        node=node->left;
    }
    return node;
}

Node *deleteNode(Node *node, int data){
    if(node==NULL)return node;
    if(data<node->data){
        node->left=deleteNode(node->left, data);
    }else if(data>node->data){
        node->right=deleteNode(node->right, data);
    }else{
        if(node->right==NULL&&node->left==NULL){
            // free(node);
            return NULL;
        }else if(node->left!=NULL){
            Node *temp=node->left;
            free(node);
            return temp;
        }else if(node->right!+NULL){
            Node *temp=node->right;
            free(node);
            return temp;
        }
        Node *temp=minNode(root->right);
        node->data=temp->data;
        node->right=deleteNode(root->right, temp->data);
    }
    return node;
}

void inOrder(Node *node){
    if(node==NULL)return;
    inOrder(node->left);
    printf("%d ", node->data);
    inOrder(node->right);
}

int main(){
    int n, data;
    scanf("%d", &n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    Node *root=NULL;
    for(int i=0;i<n;i++){
        scanf("%d", &data);
        root=addNode(root, data);
    }
    scanf("%d", &data);
    root = delteNode(root, data);
    inOrder(root);
    return 0;
}