#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(1*sizeof(Node));
    newnode->data=num;
    newnode->next=NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
    }
    else{
        tail->next=newnode;
        tail=newnode;
    }
}

void display(){
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d ",itr->data);
    }
}
Node *first,*second;
void deleteval(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;
        }
    }
}

int main(){
    int n,num,value;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&value);
    deleteval(value);
    if(head==NULL){
        pritf("List is empty");
        return 0;
    }
    if(second==NULL){
        printf("Not Found");
        return 0;
    }
    display();
    return 0;
    
}