#include<stdio.h>
#include<stdlib.h>
 typedef struct node{
     struct node* prev;
     struct node* next;
 }node;
 node*head = NULL,*tail,*iter;
 void create(int num){
     newnode->prev=NULL;
     newnode->next=NULL;
     newnode->data=num;
     if(head==NULL){
         head =newnode;
         tail=newnode;
     }else{
         newnode->prev=tail;
         tail->next=newnode;
         tail=newnode;
     }
 }
 void deletion(int val){
     iter=head->next;
     if(head->data==val){
         head=head->next;
         head->prev=NULL;
     }
     else if(tail->data==val){
         tail->prev->next=NULL;
     }
     else{
    while (itr!=NULL){
        if(iter->data==val){
            iter->prev->next=iter->next;
             iter->next->prevt=iter->prev;
             break;
        }
        iter=iter->next;
    }
     }
 }
 void display(){
     node*itr;
     for(itr=head;itr!=NULL;itr=itr->next){
         printf("%d ",itr->data);
     }
 }
 int main(){
     int N,num,ind,val;
     scanf("%d",&N);
     for(ind=0;ind<N;ind++){
         scanf("%d",&num);
         create(num);
     }
     scanf("%d",&val);
     deletion(val);
     if(iter==NULL){
         printf("Node not found");
         return 0;
     }
     display();
     return 0;
 }