#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node*next,*prev;
}a;
a*head=NULL,*tail;
void create(int num){
    a*newNode=(a*)malloc(sizeof(a));
    newNode->data=num;
    newNode->next=NULL;
    newNode->prev=NULL;
    if(head==NULL){
        head=newNode;
        tail=newNode;
    }
    else{
        tail->next=newNode;
        tail=newNode;
    }
}
void deletion(int pos,int val){
    int cnt=0;
    if(head->prev!=NULL && tail->next!=NULL){
        pos++;
        
    }
    while(1){
        if(pos==cnt){
            cnt++;
        }
    }
}
void traverse(){
    a*itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d ",itr->data);
    }
}
int main(){
    int size,val,numitr;
    scanf("%d",&size);
    if(val==NULL){
        printf("Node not found");
    }
    for(itr=0;itr<size;itr++){
        scanf("%d",&num);
        create(num);
    }
    deletion(pos,val);
    return 0;
}