#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=( Node*)ma;;oc(1*sizeof(Node));
 newNode=data->num;
 newNode->next=NULL;
 if(head==NULL)
 {
     head=newNode;
     tail=newNode;
 }
 else
 {
     tail->next=newNode;
     tail=newNode;
 }
}
void deletion(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 display()
{
    Node *i;
    for(i=head;i!=NULL;i=i->next)
    printf("%d ",i->data);
}
int main()
{
    int i,size,num,val;
    scanf("%d",&size);
    if(size==0)
    {
        printf("Not Found");
        return 0;
    }
    for(i=1;i<=size;i++)
    {
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&val);
    deletion(val);
    if(head==NULL)
    {
        printf("List is empty");
    }
    if(second == NULL)
    {
        printf("Not Found ");
    }
    display();
}