#include<stdio.h>
#include<stdlib.h>
#include<ctype.h>
typedef struct node{
    int data;
    struct node*next;
}node;
node *head=NULL,*tail=NULL;
void create (int num){
    node *newnode=(node*)malloc(1*sizeof(node));
    newnode->data=num;
    newnode->next=NULL;
    if(head==NULL){
        head=tail=newnode;
    }
    else{
        tail->next=newnode;
        tail=newnode;
    }
}
void deleteV(int value){
    if(head==NULL)
    return 0;
    
    node*curr=head;
    node*prev=NULL;
    
    if(head->data==value){
        head=head->next;
        free(curr);
        return 1;
    }
        while(curr!=NULL){
            if(curr->data==value){
                prev->next=curr->next;
                if(curr==tail)
                
                tail=prev;
                free(curr);
                return 1;
            }
            prev=curr;
            curr=curr->next;
        }
        return 0;
}
void display(){
        node *itr;
        for(itr=head;itr!=NULL;itr=itr->next)
            printf("%d ",itr->data);
        }
int main(){
        int size,num;
        scanf("%d",&size);
        if(size==0){
            printf("Not Found");
            return 0;
        }
        for(int i=1;i<size;i++){
        scanf("%d",&num);
        create(num);
        }
    int value;
    scanf("%d",&value);
    int deleted=deleteV(value);
    if(!deleted){
        printf("Not Found");
    }else if(head==NULL){
        printf("List is Empty");
    }else{
        display();
    }
    return 0;
 }