#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode{
    int data;
    struct TreeNode *left;
    struct TreeNode *right;
    
}Node;
Node *root=NULL;
Node *create (int v){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=v;
    newnode->left=newnode->right=NULL;
    return newnode;
}
Node* insert(Node *root,int v){
    if(root==NULL)
    return create(v);
    if(v<root->data)
    root->left=insert(root->left,v);
    else
    root->right=insert(root->right,v);
    return root;
}
void inorder(Node *root)
{
    if(root!=NULL){
        inorder(root->left);
        printf("%d ",root->data);
        inorder(root->right);
    }
}
int search(Node* root,int v){
    if(root==NULL||root->data==v)
    return root;
if(v<root->data)
return search(root->left,v);
return search(root->right,v);
}
Node *minimum(Node *root){
    if(root==NULL) return NULL;
    if(root->left!=NULL)
    return minimum(root->left);
    return root;
}
Node *deletion(Node *root,int v)
{
    if(root->data==v)
return root;
if(v<root->data)
root->left=deletion(root->left,v);
else if(v>root->data)
root->right=deletion(root->right,v);
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,v,val,i;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d",&v);
        root=insert(root,v);
}
scanf("%d",&val);
if(search(root,val)==NULL){
    printf("-1");
    return 0;
}
root=deletion(root,val);
inorder(root);
}