// editor1
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node*next;
    struct node*prev;
}Node;
Node *head=NULL,*tail;

void create(int num){
    Node *newnode = (Node*) malloc (sizeof(Node));
    newnode->data=num;
    newnode->next=NULL;
    newnode->prev=NULL;
    if(head == NULL){
        head = newnode;
        tail = newnode;
    }else{
        tail->next = newnode;
        newnode->prev = tail;
        tail = newnode;
    }
}
Node *deletion(Node *head,int val){
    if(head==NULL){
        return head;
    }
    if(head->data==val){
        head->next->prev = NULL;
        head = head->next;
        
    }else{
        Node *temp = head;
        while(temp!=NULL){
            if(temp->data == val){
                temp->prev->next = temp->next;
                temp->next->prev = temp->prev;
                break;
            }
            temp=temp->next;
        }
    }
    return -1;
}
void display(){
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d ",itr->data);
    }
}

int main(){
    int n,num,itr,val;
    scanf("%d",&n);
    for(itr=0;itr<n;itr++){
        scanf("%d",&num);
        create(num);
    }
    
    scanf("%d",&val);
    if(deletion(head,val) == -1){
        printf("Node not found");
    }
    display();
    return 0;
}