#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(sizeof(noded*));
    newnode->data=num;
    newnode->pre=NULL;
    newnode->next=NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
    }
    else{
    newnode->prev=tail
    tail->next=newnoded;
    tail=newnode;
    }
}
void deletion(int val){
    iter=head->next;
    if(head->data==val){
        head=head-next;
        head->prev=NULL;
    }
    else if(tail->==val){
        tail->prev=NULL;
    }
    else{
        while(iter!=NULL){
            if(iter->data==vai){
                iter->next->prev=iter->prev;
                iter->prev->next->iter->next;
                free(iter)
                break;
            }
            iter=iter->next;
        }
    }
}
void display(){
    Node *itr;
    for(itr=head,itr!=NULL;itr=itr->next){
        printf("%d",itr->data);
    }
}
int main(){
    int itr,size,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;
}