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

typedef struct node{
    int data;
    struct node *next;
    struct node *prev;
    
}N;
N *head=NULL,*tail=NULL;
void create(int val){
    N *newNode = (N*)malloc(sizeof(N));
    newNode->data=val;
    newNode->next=NULL;
    newNode->prev=NULL;
    
    if(head==NULL){
        head=tail=newNode;
    }
    else{
        newNode->prev=tail;
        tail->next=newNode;
        tail=newNode;
    }
}

void deletiom(int val){
    N *itr;
    itr=head->next;
    
    if(head->data==val){
        head=head->next;
        head->prev=NULL;
        
    }
    else if(tail->data==val){
       tail->prev->next=NULL;
    }
    
    else{
        
        while(itr !=NULL){
            if(itr->data==val){
                
                itr->next->prev=itr->prev;
                itr->prev->next=itr->next;
                break;
            }
            iter=iter->next;
            
        }
        
    }
}

void display(){
    N *temp;
    
    while(temp!=NULL){
        printf("%d ",temp->data);
        temp=temp->next;
    }
}

int main(){
    
    int n,val,ele;
    scanf("%d",&n);
    for(int i=0 ; i<n ;i++){
        scanf("%d",&val);
        create(val);
    }
    scanf("%d",&ele);
    deletion(ele);
    
    
    return 0;
    
}