// editor1
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left;
    struct node *right;
}Node;
Node *create(int num){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=newnode->right=NULL;
    return newnode;
}
Node *insert(Node *root,int num){
    if(root==NULL){
        return create(num);
    }
    if(num<root->data){
        root->left=insert(root->left,num);
    }
    else{
        root->right=insert(root->right,num);
    }
    return root;
}
Node *findMin(Node *root){
    while(root->left!=NULL){
        root=root->left;
    }
     return root;
}
Node *deleteNode(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){
        Node *temp=root->right;
        free(root);
        return temp;
    }
    else if(root->right==NULL){
        Node *temp=root->left;
        free(root);
        return temp;
    }
    Node *temp=findMin(root->right);
    root->data=temp->data;
    root->right=deleteNode(root->right,temp->data,found);
}
return root;
}

int main(){
    int n,num,key,found=0;
    Node *root=NULL;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&num);
        root=insert(root,num);
    }
    scanf("%d",&key);
    root=deleteNode(root,key,&found){
    return 0;
}