#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=(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 delpos(int pos){
    if(pos==0){
        Node *temp=head;
        head=head->next;
        free(temp);
    }
    Node *curr=head;
    for(int i=o;i<pos-1;i++){
        curr=curr->next;
    }
    Node *temp=curr->next;
    curr->next=temp->next;
    if(temp==tail){
        tail=curr;
    }
    free(temp);
}

void display(){
    Node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d ",itr->data);
    }
}

int main(){
    int n,num,p;
    scanf("%d",&n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<n;i++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&p);
    if(p>=n || p<=0){
        printf("Invalid input");
        return 0;
    }
    delpos(p);
    return 0;
}