// editor1
#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{
        newnode->prev=tail;
        tail->next=newnode;
        tail=newnode;
    }
}
Node *first,*second;
int del(int val){
    if(head==NULL)return 0;
    int found=0;
    first=head;
    second=head->next;
    if(first->data==val){
        found=1;
        head=head->next;
        head->prev=NULL;
        free(first);
        return -1;
    }
    else{
        while(seccond!=NULL){
            if(second->data==val){
                found=1;
                first->next=second->next;
                if(second->next!=NULL){
                    second->next->prev=first;
                }
                else 
                    tail=first;
                free(second);
                return 1;
            }
            first=first->next;
            second=second->next;
        
    }
}
void display(){
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d ",itr->data);
    }
}
int main(){
    int size,num;
    scanf("%d",&size);
    if(size<=0){
        printf("Node not found");
        return 0;
    }
    for(itr=0;itr<size;itr++){
        scanf("%d",&num);
        create(num);
    }
    int val;
    scanf("%d",&val);
    int result=del(val);
    if(result==0){
        printf("Node not found");
        return 0;
    }
    else
       display();
    return 0;
}