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