#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *next;
}Node;
Node *head=Null,*tail;
void create (int num)
{
    Node*newNode;
    newNode = (Node*) malloc (1 * sizeof(Node));
    newNode->data = num;
    newNode->next = NULL;
    if(head == NULL) {
        head = newNode;
        tail = newNode;
    }
    else
    {
        tail->next=newnode;
        tail=newnode;
        
    }
}
void delete(int pos)
{
    Node *first=head;
    Node *second=head->next;
    int cnt=1;
    while(1)
    {
        if(cnt==pos)
        {
            
            first->next=second->next;
            break;
        }
        first=first->next;
        second=second->next;
        cnt++;
    }
}
void display()
{
    Node *itr;
    for(itr=head;itr;itr=itr->next)
    {
        printf("%d ",itr->data);
    }
}
int main(){
    int size,num,itr,pos;
    scanf("%d",&size);
    if(size<0)
    {
        printf("Invalid input");
        return 0;
    }
    for(itr=1;itr<=size;i++)
    {
        scanf("%d",&num);
        create(sum);
    }
    scanf("%d",&pos);
    if(pos<1 ||pos>=size){
        printf("Invalid input");
        return 0;
    }
    delete(pos);
    display();
    return 0;
}

}