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

typedef struct node
{
    int data;
    struct node *right,*left;
}node;
node *newnode,*root=NULL;

node* create(int num)
{
    newnode=(node*)malloc(sizeof(node));
    newnode->right=NULL;
    newnode->left=NULL;
    newnode->data=num;
}

node* min(node* root)
{
    if(root!=NULL)
    {
        if(root->left !=NULL)
        {
            root->left=min(root->left);
        }
        else
        {
           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->right ==NULL && root->left==NULL)
        {
            return NULL;
        }
        else if(root->left == NULL && root->right !=NULL)
        {
            return root->right;
        }
        else if(root->right == NULL && root->left !=NULL)
        {
            return root->left;
        }
        else
        {
            node* temp =min(root->right);
            root->data=temp->data;
            root->right=deletion(root->right,temp->data);
        }
        
    }
    return root;
}
node* insert(node* root,int num)
{
    if(root==NULL)
    {
        return create(num);
    }
    if(root->data < num)
    {
        root->right=insert(root->right,num);
    }
    else if(root->data > num)
    {
        root->left=insert(root->left,num);
    }
    return root;
}

void inorder(node* root)
{
    if(root!=NULL)
    {
        inorder(root->left);
        printf("%d ",root->data);
        inorder(root->right);
    }
}
int main()
{
    int num[121],i,size;
    scanf("%d",&size);
    for(i=0;i<size;i++)
    {
        scanf("%d",&num[i]);
        root=insert(root,num);
    }
    int k,c=0;
    scanf("%d",&k);
    if(int i=0;i<size;i++)
    {
        if(num[i]==k)
        {
            c++;
        }
    }
    if(c==0)
    {
        printf("-1");
        return 0;
    }
    
    node* res= deletion(root,k);
    inorder(root);
    
}