#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    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;
if(head==NULL){
head=newnode;
tail=newnode;
}
else{
    tail->next=newnode;
    tail=newnode;
}
}
Node *first,*second;
void deleteVal(int val){
    first=head;
    second=head->next;
    if(Val==head->data){
        head=head->head;
    }
    else{
        while(second!=NULL){
            if(second->data==Val){
                first->next=second->next;
                break;
            }
            first=second;
            second=second->next;
        }
    }
}
void display(){
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d ",itr->data);
    }
}
int main (){
    int size,num,Val;
    scanf("%d",&size);
    for(int i=0;i<size;i++){
        scanf("%d",&num);
    create(num);
    }
    scanf("%d",&Val);
    deleteVal(Val);
    if(head==NULL){
        printf("List is empty");
        return 0;
    }
    if(second ==NULL){
        printf("Not Found");
        return 0;
    }
    else
    display();
    return 0;
}