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


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

Node *root = NULL;

Node *createBST(int num){
    Node *newnode=(Node*)malloc(sizeof(Node));
    
    newnode->data=num;
    newnode->left=newnode->right=NULL;
    return newnode;
}


Node *insertBST(Node *root, int num){
    if(root==NULL){
        return createBST(num);
    }
    if(root->data>num){
        root->left=insertBST(root->left, num);
    }else{
        root->right=insertBST(root->right, num);
    }
    return root;
}


void minimum(){
    while(root!=NULL)
        root=root->left;
    return root;
}

struct Node *deleteNode(struct Node* root, int key, /*int *found*/){
    if(root == NULL)
        return NULL;
        
    if (key < root->data){
        root->left = deleteNode(root->left, key, /*found*/);
    }
    else if(key > root->data){
        root -> right = deleteNode(root->right, key, /*found*/);
    }
    else{
        //*found = 1;
        
        if(root->left == NULL){
            struct Node* temp = root->right;
            free(root);
            return temp;
        }
        else if(root->right == NULL){
            struct Node* temp = root->left;
            free(root);
            return temp;
        }
        
        struct Node* temp = minimum(root->right);
        root->data = temp->data;
        root->right = deleteNode(root->right, temp->data, /*found*/);
    }
}


int main(){
    int size, val, num;
    scanf("%d", &size);
    
    if(size<0 || val<0){
        printf("Invalid input");
        return 0;
    }
    
    for(int i=0; i<size; i++){
        scanf("%d", &num);
        root = insertBST(root, num);
    }
    scanf("%d", &val);
    deleteNode(root, val);
    return 0;
}