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

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

struct Node*head = NULL;
struct Node*tail = NULL;

void create(int value){
    struct Node*newnode = (struct Node*)malloc(sizeof(struct Node));
    newNode-> data = value;
    newNode -> next = NULL;
    
    if(head == NULL){
        head=newNode;
        tail=newNode;
    }else{
        tail->next=newNode;
        tail = newNode;
    }
}
void deleteByvalue(int val){
    struct Node*temp = head;
    struct Node*prev = NULL;
    while (temp != NULL){
         if(temp->data == val){
             if(prev == NULL)
                  head = temp->next;
         }else{
             prev->next = temp->next;
         }
        free(temp);
         return 1;
    }
    prev = temp;
    temp = temp->next;
 }
 return 0;
 }
 
 void display(){
     struct Node*temp = head;
     while(temp!=NULL){
         printf("%d", temp->data);
         temp = temp->next;
     }
 }
 int main(){
     int n,value,del;
     scanf("%d", &n);
     for(int i=0; i<n; i++){
         scanf("%d", &value);
         create(value);
     }
     scanf("%d", &del);
     if(deleteByvalue(del)){
         printf("Not Found");
     }else{
         display();
     }
 }