#include <stdio.h>
#include <stdlib.h>

typedef struct node{
    int data;
    struct node *next;
}Node;

Node *head = NULL,*tail;
Node *first,*second;

int cnt=0; 

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(head->data == val){
        head = head->next;
    }
    else if{
        while(second!=NULL){
            if(second->data == val){
                first->next = second->next;
                cnt=1;
                break;
            }
            first = first->next;
            second = second->next;
        }
    }
    else{
        printf("Not Found");
        return 0;
    }
    
}

void display(){
    Node *itr;
    if(cnt == 0){
        printf("Not Found");
    }
    else{
        for(itr = head;itr != NULL;itr = itr->next)
            printf("%d ",itr->data);
    }
}

int main(){
    int N,ind,num,val;
    scanf("%d",&N);
    if(N<0){
        printf("Not Found");
        return 0;
    }
    for(ind=0;ind<N;ind++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&val);
    
    if(head == NULL){
        printf("List is empty");
        return 0;
    }
    deletion(val);
    display();
    
}