// editor1
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *next;
    struct node *prev;
}Node;
Node *head,*tail,*iter;
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->pevious = tail;
        tail->next = newnode;
        tail = newnode;
        }
}
void deletion(int val){
    iter = head->next;
    if(head->data == val){
        head = head->next;
        head->previous = NULL;
    }else if(tail->data==val){
        tail->previous->next = NULL;
    }
    else{
        while(iter!=NULL){
            if(iter->data==val){
            iter->previous->next = iter->next;
            iter->next->previous = iter->previous;
            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",&num);
        create(num);
    }
    scanf("%d",&val);
    deletion(val);
    if(iter==NULL)
        printf("Node not found");
    else{
        display();
    }
    return 0;
    
}