// editor1
#include<stdio.h>
#include<stdlib.h>
int create(int num);
int del(int num);
int display();
typedef struct node
{
    int data;
    struct node *next,*pre;
    
}node;
node *tail,*head,*newnode,*itr;

int main()
{
    int size ,n,i;
    scanf("%d",&size);
    for(i=0;i<size;i++){
        scanf("%d",&n);
        create(n);
        
    }
    int val;
    scanf("%d",&val);
    del(val);
    if(itr==head)
    {
         printf("Node not found");
        return 0;
    }
  display();
   
    return 0;
}
int create(int num){
    newnode=(node*)malloc(sizeof(node));
    newnode->next=NULL;
    newnode->pre=NULL;
    newnode->data=num;
    if(head==NULL)
    {
        head=newnode;
        tail=newnode;
    }
    else{
        newnode->pre=tail;
        tail->next=newnode;
        tail=newnode;
        
    }
    
    tail->next=head;
    head->pre=tail;
}
int del(int num){
   //int c=0;
   itr=head->next;
    if(head->data==num)
    { 
        node * t;
      t=head;
      head=head->next;
      tail->next=head;
      head->pre=tail;
      free(t);
    }
    else if(tail->data==num)
    {
        tail=tail->pre;
        tail->next=head;
        head->pre=tail;
    }
    else
    {
        while(itr!=head)
        {
            if(itr->data==num)
            {
                itr->pre->next=itr->next;
                itr->next->pre=itr->pre;
                break;
            }
            itr=itr->next;
        }
       /* node *tem,*tem1,*t;
       for(tem=head;tem->data!=num;tem=tem->next)
       {
           tem1=tem;
           
       }
       t=tem;
       tem1->next=tem->next;
       tem->next->pre=tem1;
       if(t->data==num)
    {
        c++;
    }
    }
    
     if(c==0)
    {
        printf("Node not found");
        return 0;
    }*/
  
}
int display()
{
    node *tem; printf("%d ",head->data);
     for(tem=head->next;tem!=head;tem=tem->next)
       {
         printf("%d ",tem->data);
           
       }
    
}