#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 (1 * sizeof(Node));
    newNode->data = num;
    newNode->prev = NULL;
    newNode->next = NULL;
    if(head==NULL) {
        head = newNode;
        tail = newNode;
    }
    else {
        newNode->prev = tail; // DLL
        tail->naxt = newNode; //SLL
        tail = newNode;
        }
}
void deletion(int val) {
    iter = head->next;
    if(head->data==next) {
        head=head-next
        head->prev = NULL;
    }    
else if(tail->data == val) {
    while(iter!=NULL) {
        if(iter->data==val) {
            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 size,itr,num,val;
    scanf("%d",&size);
    for(itr=1;itr<=size;itr++) {
        scanf("%d",&sum);
        create(num);
    }
    scanf("%d",&val);
    deletion(val);
    if(iter == NULL)
      printf("Node not found");
      
}