#include<stdio.h>
#include<stdlib.h>
struct node{
    int rollNumber;
    struct node* next;
};
struct node* head = NULL;
void insert(int roll){
    struct node * newNode = (struct node*)malloc(sizeof(struct node));
    newNode->rollNumber = roll;
    newNode->next = NULL;
    if(head == NULL){
        head = newNode;
    }else{
        struct node *temp = head;
        while(temp->next!=NULL){
            temp = temp->next;
        }
        temp->next = newNode;
    }
}
void deleteNode(int toDelete){
    struct node*temp=head;
    struct Node*prev=NULL;
    if(temp!=NULL && temp->rollnumber==toDelete){
        head=temp->next;
        free(temp);
        return;
    }
    while(temp != NULL && temp->rollNumber != toDelete){
        prev=temp
        temp=temp->next;
    }
    if(temp==NULL){
        printf("Not Found\n");
        return;
    }
    prev->next = temp->next;
    free(temp);
    void display(){
        if(head==NULL){
            printf("List is empty\n");
            return;
        }
        struct Node* temp=head;
        while(temp!=NULL){
            printf("%d",temp->rollNumber);
           temp=temp->next;
        }
        printf("\n");
    }
    int main(){
        int n, rillNumber, toDelete;
        scanf("%d",&n);
        for(int i=0;i<n; i++){
            scanf("%d",&rollNumber);
            insert(rollNumber);
        }
         scanf("%d",&toDelete);
         deleteNode(toDelete);
         display();
         return 0;
    }
}