#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 *insert(Node *root,int val){
    if(root==NULL)
        return create(val);
    if(val < root->data)
        root->left=insert(root,val);
    else
        root->right=insert(root,val);
    return root;
}
Node *findMin(Node *root){
    while(root->left!=NULL)
        root=root->left;
    return root;
}
Node *deleteval(Node *root,int key,int *found){
    if(root==NULL)
        return NULL;
    if(key < root->data)
        root->left=deleteval(root->left,key,found);
    else if(key > root->data)
        root->right=deleteval(root->right,key,found);
    else{
        *found=1;
        if(root->left==NULL){
            Node *temp=root->right;
            free(temp);
            return temp;
        }
        else if(root->right==NULL){
            Node *temp=root->left;
            free(temp);
            return temp;
        }
        
        Node *temp=findMin(root->right);
        root->data=temp->data;
        root->right=deleteval(root->right,temp->data,found);

        
}
}
void inorder(Node *root){
    if(root==NULL)
        return;
    inorder(root->left);
    printf("%d ",root->data);
    inorder(root->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);
        root=insert(root,x);
    }
    int y;
    scanf("%d",&y);
    deleteval(root,y);
    inorder(root);
}