#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 *itr;
    for(itr=head;itr!=NULL;itr=itr->next)
        printf("%d ",itr->data);
}
int main(){
    int s,i,n,v;
    scanf("%d",&s);
    if(s==0){
        printf("Not found");
        return 0;
    }
    for(i=1;i<=s;i++){
        scanf("%d",&n);
        create(n);
    }
    scanf("%d",&val);
    deletion(val);
    if(head==NULL){
        printf("list is empty");
        return 0;
    }
    if(second==NULL)
        printf("Not found");
    else
        display();
    return 0;
}