#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(1*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);
    }
    if(num < root->data){
        root->left = insert(root->left,num);
    }
    else if(num > root->data){
        root->right = insert(root->right,num);
    }
    return root;
}

Node* min(Node* root){
    if(root==NULL){
        return root;
    }
    if(root->left != NULL){
        return min(root->left);
    }
    return root;
}

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

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

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