#include <stdio.h>
#include <stdlib.h>

struct node
{
    int data;
    struct node *next;
};
struct node* dele(struct node *head,int pos)
{
    if(head == NULL)
    return head;
    
    struct node *temp = head;
    if(pos == 0)
    {
        head = head->next;
        free(temp);
        return head;
    }
    for(int i=0;temp != NULL && i < pos - 1; i++)
    {
        temp = temp->next;
    }
    if(temp == NULL || temp->next == NULL)
    return head;
    
    struct node *del = temp-next;
    temp = temp->next;
    free(del);
    
    return head;
}
int main()
{
    int n;
    scanf("%d",&n);
    
    if(n<=0)
    {
        printf("Invalid input");
        return 0;
    }
    
    struct node *head = NULL, *temp = NULL;
    for(int i=0;i<N;i++)
    {
        struct node *newnode = (struct node*)malloc(sizeof(struct node));
        scanf("%d",&newnode->data);
        newnode->next = NULL;
        
        if(head == NULL)
         head = newnode;
         else
         temp->next = newnode;
         temp = newnode;
    }
    int p;
    scanf("%d",&p);
    head = dele(head,p);
    temp = head;
    while(temp != NULL)
    {
    printf("%d",temp->data);
    temp=temp->next;
}
    return 0;
    
}