#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 *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 *min(node *root){
    while(root->left!=NULL)
        root=root->left;
    return root;
}
void *deleten(node *root,int key,int *found){
    if(root==NULL)return NULL;
    if(key<root->data){
        root->left=deleten(root->left,key,found);
    }
    else if(key>root->data)
        root->right=deleten(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=min(root->right);
    root->data=temp->data;
    root->right=deleten(root->right,temp->data,found);
    }
    return root;
}
void inorder(node *root){
    if(root!=NULL){
        inorder(root->left);
        printf("%d",root->data);
        inorder(root->right);
    }
}
int main(){
    int size,val,num;
    node *root=NULL;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<n;i++){
        scanf("%d",&num);
        root=insert(root,num);
    }
    int found=0;
    scanf("%d",&val);
    root=deleten(root,val,&found);
    if(!found){
        printf(-1);
    }
    else
        inorder(root);
    return 0;
}