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


typedef struct node{
    int data;
    struct node *right,*left;
}Node;

Node *create(int val){
    
    Node *n=(Node*)malloc(sizeof(Node));
    n->data=val;
    n->left=NULL;
    n->right=NULL;
    return n;
}

Node *insert(Node *root ,int num){
    if(root==NULL){
        return create(num);
    }
    else if(root->data < num){
        root->left=insert(root->left,val);
    }
    else if(root->data < num){
        root->right=insert(root->right,val);
    }
    return root;
}

void inorder(Node *root){
    if(root != NULL){
        printf("%d",root->data);
        inorder(root->left);
        inorder(root->right);
    }
}
Node *minimum(Node *root){
    if(root==NULL)
        return root;
    if(root->left != NULL){
        return minimum(root->left);
        return root;
    }
}

Node *search(Node *root , int num){
    if(root==NULL || root->data==NULL){
        return root;
    if(num<root->data)
        return search(root->left,num);
        return search(root->right,num);
}
Node *deletion(Node *root , int num){
    if(root==NULL)
        return root;
    if(num < root->data){
        root->left=deletion(root->left,num);
    }
    else if(num > root->data){
        root->right=deletion(root->right,num);
    }
    else{
        if(root->left==NULL && root->right==NULL){
            return NULL;
        }
        else if(root->left !=NULL && root->right==NULL){
            return root->left;
        }
        else if(root->left ==NULL && root->right!=NULL){
            return root->right;
        }
        else{
            Node *temp=minimum(root->right);
            root->data=temp->data;
            root->right=deletion(root->right,temp->data);
        }
    }
    return root;
}


int main(){
    int n,val,num;
    scanf("%d",&n);
    for(int i=0 ; i<n;i++){
        scanf("%d",&val);
        root=insert(root ,val );
    }
    scanf("%d",&num);
    if(search(root , num)==NULL){
        printf("-1");
        return 0;
    }
     root=deletion(root,num);
     inorder(root);
    return 0;
}