// editor1

#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode{
    int data;
    struct TreeNode *left;
    struct TreeNode *right;
}Node;
Node*root=NULL;
Node *create(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 create(num);
    }
    if(num<root->data){
        root->left=insertBST(root->left,num);
    }
    else{
        root->right=insertBST(root->right,num);
    }
    return root;
}
Node* minimum(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=right->left;
        free(root);
        return temp;
    }
    Node* temp = minimum(root->right);
    root->data = temp->data;
    root->right = deleteNode(root->right,temp->data,found)
    }
    return root;
}
void inorder(Node* root){
    if(root!=NULL){
        inorder(root->left);
        printf("%d",root->right);
        inorder(root->right);
    }
}
int main(){
    int size,val,num,i;
 
    scanf("%d",&size);
    if(size<=0){
        printf("Invalid input");
        return 0;
    }

    for(int i=0;i<size;i++){
        scanf("%d",&num);
        root=insertBST(root,num);
    }
    int found=0;
    scanf("%d",&val);
    root=deleteNode(root,val,&found);
    
    if(!found){
        printf("-1");
    }
    else{
        inorder(root);
    }
        
    return 0;
}