#include<stdio.h>
#include<stdlib.h>
void display();
int create(int num);
int del(int num);
void display();

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

node *newNode =NULL;
node *head = NULL;
node *tail = NULL;
node *first *second;

int main()
{
    int size,i,num,val;
    scanf("%d",&size);
    deletion(val);
    if(size ==0){
        printf("Not Found");
        return 0;
    }
    for(i=i;i<size;i++){
        scanf("%d",&num);
        create (num);
    }
    scanf("%d",&val);
    if(head == NULL){
        printf("list is empty");
    }
    if(secomd == NULL){
        printf("Not Found");
    }
    else{
        display();
        return 0;
    }
int create(int num){
        newnode(node*)malloc(sizeof(node));
        newnode->next=NULL;
        newnode->data=num;
}
if(head==NULL){
    head=newnode;
    tail=newnode;
}
else{
    tail->next=newnode;
    tail=newnode;
}
}
int del(int num){
    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;
              secomd = second->next;
          }
      }
}
void display(){
    node *temp;
    for(temp=head;temp!=NULL;temp=temp->next){
        printf("%d",temp->data);
    }
}