#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node*next;
    struct node*prev;
}Node;
Node *head=NULL,*tail;
void create(int num)
{
    Node *newnode=(Node*)malloc(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(int pos)
{
    Node*i;
    for(i=head;i!=NULL;i=i->next)
    {
        printf("%d ",i->data);
    }
    printf("\n");
}
void removeduplicates()
{
    Node*temp=tail;
    int count=1;
    while(temp!=NULL && count<pos)
    {
        temp=temp->prev;
        count++;
    }
    if(temp==NULL)
     printf("Invalid input");
     else
     printf("%d",temp->data);
}
int main()
{
    int i,n,num,pos;
    scanf("%d",&n);
    if(n<0)
    {
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<n;i++)
    {
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&pos);
    if(pos>n)
    {
        printf("Invalid input");
        return 0;
    }
    display(pos);
}