#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *next;
    struct node *prev;
}node;

node *head = NULL,*tail,*iter;
void create(int num){
    node *newnode = (node*) malloc (1 *sizeof(node));
    newnode->data=num;
    newnode->next=NULL;
    newnode->prev=NULL;
    if(head == NULL){
        head =newnode;
        tail =newnode;
    }
    else{
        newnode->prev=tail;
        tail->next=newnode;
        tail=newnode;
    }
}
void del(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(iter!=NULL){
            if(iter->data == val){
                iter->next->prev=iter->prev;
                iter->prev->next=iter->next;
                break;
            }
            iter = iter->next;
        }
    }
}
void dispaly(){
    node *i;
    for(i=head;i!=NULL;i=i->next)
       printf("%d",i->data);
}
int main(){
    int size,itr,n,val;
    scanf("%d",&size);
    for(itr=1;itr<=size;itr++){
        scanf("%d",&n);
        create (n);
    }
    scanf("%d",&val);
    del(val);
    if(itr=NULL){
        printf("Node not found");
        
    }
    else{
        display();
    }
    return 0;
}