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