#include<stdio.h>
#include<stdlib.h>

typedef struct Node{
    int data;
    struct Node *next,*prev;
}node;

node* head = NULL,*tail;

void insert(int num){
    node* newNode = (node*)malloc(sizeof(node));
    newNode->data = num;
    newNode->next = NULL;
    newNode->prev = NULL;
    if(head == NULL){
        head = newNode;
    }
    else{
        newNode->prev = tail;
        tail->next = newNode;
    }
    tail = newNode;
}

void deletion(int del){
    node* i;
    int cnt=0;
    for(i=head;i!=NULL;i=i->next){
        if(i->data == del){
            i->prev->next = i->next;
            cnt++;
        }
    } 
    if(!cnt){
        printf("Node not found");
        return 0;
    }
}

void display(){
    node* i;
    for(i=head;i!=NULL;i=i->next){
        printf("%d ",i->data);
    }
}

int main(){
    int n,num,del;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&num);
        insert(num);
    }
    scanf("%d",&del);
    deletion(del);
    display();
}