#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(1*sizeof(Node));
    newNode->data = num;
    newNode->next = NULL;
    if(head==NULL){
        head = newNode;
        tail = newNode;
    }
    else{
        tail->next = newNode;
       // newNode->prev = tail;
        tail = newNode;
    }
}

Node *fast, *slow, *temp=head;
void deletion(){
    slow = head;
    fast = head;
    while(fast != NULL && fast->next != NULL){
        slow = slow->next;
        fast = fast->next->next;
    }
    for(i=0;i<slow;i++){
        //prev = temp;
        temp = temp->next;
    }
    prev->next = temp->next;
    free(temp);
}

int main(){
    int size,i,num;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<size;i++){
        scanf("%d",&num);
        create(num);
    }
    deletion();
    return 0;
}