#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *prev;
    struct node *next;
}Node;
Node *head = NULL,*tail;
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{
        tail->next=newnode;
        newnode->prev=tail;
        tail=newnode;
    }
}


void deleteval(int val){
    Node *first,*second;
    first=head;
    second=head->next;
    if(head->data==val){
        head=head->next;
    }
    else{
        while(second != NULL){
            if(second->data=val){
                first->next=second->next;
                break;
            }
            first=first->next;
            second=second->next;
        }
    }
}
int main(){
    int size,num,itr,val;
    scanf("%d",&size);
    if(size<=0){
        printf("Node not found");
        return 0;
    }
    for(itr=1; itr<=size; itr++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&val);
    deleteval(val);
    display();
    return 0;
}