#include<stdio.h>
#include<stdlib.h>
int n,c;
typedef struct node{
    int data;
    struct node *next,*prev;
}Node;

Node *head=NULL,*tail;


void create(int num){
    Node *newNode=(Node*)malloc(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;
    }
    
}

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

// void deletion(int val){
//     Node *itr;
//     for(itr=head;itr!=NULL;itr=itr->next)
//     if(itr->data == val){
//         itr->next=itr->prev;
//         c=1;
//     }
        
// }
void deletion(int val){
    Node *first=head;
    Node *second=head->next;
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        if(itr->data == val){
            first->next=second->next;
        }else{
            first=first->next;
        }
    }
}
int main(){
    int i,val,num;
    scanf("%d",&n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<n;i++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&val);
    deletion(val);
    display();
    return 0;
}