#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*)malloc(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 size,i,val,num;
    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");
        return 0;
    }
    if(second==NULL)
    {
        printf("Not found");
        return 0;
        
    }
    else{
    display()
    
    }
    return 0;
}