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

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

Node *head=NULL;
Node *tail;
Node *newnode;
Node *tem;

void create(int num){
    newnode=(Node*)malloc(sizeof(Node));
    head->data=num;
    newnode->prev=NULL;
    newnode->next=NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
        }
        else{
      tail=newnode->prev;
      tail->next=newnode;
      tail=newnode;
}
}
void del(int v){
    tem=head->next;
    if(head->data==v){
        head=head->next;
        head->prev=NULL;
    }
    else if(tail->data==v){
        tail->prev->next=NULL;
    }
    else{
        while(tem!=NULL){
            if(tem->data==v){
                tem->next->prev=tem->prev;
                tem->prev->next=tem->next;
            }
            tem=tem->next;
        }
    }
    
}
void display(){
    Node *tem;
    for(tem=head;tem!=NULL;tem=tem->next){
        printf("%d",tem->data);
    }
}
int main(){
    int size;
    int tem,num,v;
    scanf("%d",&size);
    for(tem=0;tem<size;tem++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&v);
    del(v);
    if(tem==NULL){
        printf("Node not found");
    }
    else{
        display();
    }
    return 0;
}