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

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

Node *head=NULL,*tail ,*temp,*prev;

void create(int num){
    
    Node *newNode = (Node*)malloc(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){
    temp=head;
    if(pos==1){
       head = head->next;
       free(temp);
    }
    int i;
    for(i=1 ; i< pos&&temp!=NULL){
        prev=temp;
        temp=temp->next;
    }
       prev->next=temp->next;
       
       if(temp==tail){
           tail=prev;
       }
       free(temp);
    
}

void display(){
    Node *i=head;
    while(temp!=NULL){
        printf("%d ",i->next);
        i++;
    }
}

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