#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;
    }
}
void deletion(int val) {
    node*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("Not found");
        return 0;
    }
    for(itr=1;itr<=size;itr++) {
        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");
    else 
       display();
    return 0;
}