#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *next ,*prev, *iter;
}Node;
Node *head=NULL, *tail=NULL, *iter=NULL;
void create(int num)
{
    Node *newNode=(Node*) malloc (1 * sizeof(Node));
    newNode->data=num;
    newNode->next=NULL;
    newNode->prev=NULL;
    if(head==NULL)
    {
        head=newNode;
        tail=newNode;
    }
    else
    {
        newNode->prev=tail;
        tail->next=newNode;
        tail=newNode;
    }
}
void display()
{
    Node *itr,*iter;
    for(itr=head;itr!=NULL;itr=itr->next);
    {
        printf("%d ",itr->data);
    }
}
void deletion(int val)
{
    iter=head->next;
    if(head->data==val)
    {
        head=head->next;
        head->next=data;
    }
    else if(tail->data==val)
    {
        tail->next->prev=data;
    }
    else
    {
        if(iter->data==val)
        {
            iter->next->prev=iter->prev;
            iter->prev->next=iter->next;
        }
        iter=iter->next;
    }
}
int main()
{
    int size,i,num,iter;
    scanf("%d",&size);
    if(size<0)
    {
        printf("Node not found");
        return 0;
    }
    for(i=0;i<size;i++)
    {
        scanf("%d",&num);
        create(num);
    }
    if(iter==NULL)
    {
        printf("Node not found");
    }
    else
    {
        deletion(val);
        display();
    }
    return 0;
}