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

struct Node{
    int data;
    struct Node* next;
};


struct Node* createNode(int value) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = value;
    newNode->next = NULL;
    return newNode;
}

void toDelete(struct Node** head, int pos) {
    
    if (head == NULL) return;
    struct Node* temp = *head;
    if(pos == 1) {
        *head = temp->next;
        free(temp);
    }
    struct Node* prev = NULL;
    int i = 1;
    while(temp != NULL && i < pos) {
        prev = temp;
        temp = temp -> next;
        i++
    }
    
    if(temp == NULL) {
        return;
    }
    
    prev -> next = temp -> next;
    free(temp);
    
}

int main() {
    
    int n, i;
    struct Node* head = NULL;
    struct Node* tail = NULL;
    if(scanf("%d", &n) != 1 || n < 1 || n > 100) {
        printf("Invalid input");
        return 0;
    }
    
    int arr[n];
    for(i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
        
        struct Node* node = createNode(arr[i]);
        if(head == NULL) {
            head = tail = node;
        } else {
            tail->next = node;
            tail = node;
        }
    }
    int pos;
    if(scanf("%d", &pos) != 1 || pos < 1 || pos > n) {
        printf("Invalid input");
        return 0;
    }
    
    toDelete(&head, pos);
    
    struct Node* temp = head;
    
    while(temp != NULL) {
        printf("%d", temp->data);
        temp = temp->next;
    }
    

    
    
    
    return 0;
}