#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *left,*right;
}Node;
Node *root=NULL;
Node *create(int num)
{
    Node *newNode=(Node*)malloc(sizeof(Node));
    newNode->data=num;
    newNode->left=NULL;
    newNode->right=NULL;
    return newNode;
}
Node *insert(Node *root,int num)
{
    if(root==NULL)
        return create(num);
    else if(num<root->data)
        root->left=insert(root->left,num);
    else if(num>root->data)
        root->right=insert(root->right,num);
    return root;
}
void preOrder(Node *root)
{
    if(root!=NULL)
    {
        printf("%d",root->data);
        preOrder(root->left);
        preOrder(root->right);
    }
}
void postOrder(Node *root)
{
    if(root!=NULL)
    {
        postOrder(root->left);
        postOrder(root->right);
        printf("%d",root->data);
    }
}
void inOrder(Node *root)
{
    if(root!=NULL)
    {
        inOrder(root->left);
        printf("%d",root->data);
        inOrder(root->right);
    }
}
Node *search(Node *root,int val)
{
    if(root==NULL || root->data==val)
        return root;
    else if(val<root->data)
    return search(root->left,val);
    return search(root->right,val);
}
Node *minimum(Node *root)
{
    if(root==NULL)
        return root;
    if(root->left != NULL)
        return minimum(root->left);
    return root;
}
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 root;
            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 size,num,itr,val;
    scanf("%d",&size);
    for(itr=1;itr<=size;itr++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
    scanf("%d",&val);
    if(search(root,val)==NULL)
    {
        printf("-1");
        return;
    }
    root=deletion(root,val);
    inOrder(root);
}