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