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

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

Node *head=0,*tail;

void create(int num){
    Node *newNode =(Node*) malloc(1*sizeof(newNode));
    newNode->prev=NULL;
    newNode->data=num;
    newNode->next=NULL;
    
    if(head==0){
        head = newNode;
        tail = newNode;
    }
    else{
        newNode->prev=tail;
        tail->next=newNode;
        tail = newNode;
    }
}

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








void deletion(int val){
    itr=head->next;
    if(head)
}

int main(){
    int size,num,itr,pos,val;
   
     if( !scanf("%d" ,&size);){
         printf("Invalid input");
         return 0;
     }
     for(int itr=0;itr!=NULL;itr=itr->next){
         printf("%d",it->data);
     }
     if(pos<1 || pos>=size){
         printf("Node not found");
         return 0;
     }
     create(num);
     display();
     
     return 0;
}