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

typedef struct node{
    struct node*prev;
    int data;
    struct node *next;
}Node;

Node *head=NULL, *tail,*iter;

void create(int num){
    Node *newNode=(Node*)malloc(1*sizeof(Node));
    newNode->prev=NULL;
    newNode->data=num;
    newNode->next=NULL;
    
    if(head=NULL){
        head=newNode;
        tail=newNode;
    }
    else{

        tail->next = newNode;
        tail = newNode;
    }
}

void deletion(int val){
    itr=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->next->prev =iter->prev;
                iter->perv->next=iter->next;
                break;
            }
            iter=iter->next;
        }
    }
}

void display(){
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next)
        printf("%d",itr->data);
}

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