#include<stdio.h>
#include<stdlib.h>
struct Node
{
    int data;
    struct Node *next;

}*head;

void createlinklist(int n);
void display();
void insertfirst(int data);
void insertend(int data1);
int main()
{
    int n,data,data1;
    printf("Enter the number of nodes: ");
    scanf("%d",&n);
    createlinklist(n);
    printf("\nData entered in the list are:\n");
    display();
    printf("Enter data to insert at the first of the list: ");
    scanf("%d",&data);
    insertfirst(data);
    display(data);
    printf("Enter data to insert at the end of the list: ");
    scanf("%d",&data1);
    insertend(data1);
    display(data1);
    return 0;
}
void createlinklist(int n)
{
    struct Node *p, *temp;
    int data, i;
    head= (struct Node*)malloc(sizeof(struct Node));
    printf("Input data for node 1: ");
    scanf("%d",&data);
    head->data=data;
    head->next=NULL;
    p=head;
    temp=head;
    for(i=2; i<=n; i++)
    {
        printf("Enter data for node %d: ",i);
        scanf("%d",&data);
        temp=(struct Node*)malloc(sizeof(struct Node));
        temp->data=data;
        temp->next=NULL;
        p->next=temp;
        p=p->next;

    }
}
void display()
{
    struct Node *temp;
    temp=head;
    while(temp!=NULL)
    {
        printf("%d\n",temp->data);
        temp=temp->next;
    }
}
void insertfirst(int data)
{
    struct Node *newnode;
    newnode=(struct Node*)malloc(sizeof(struct Node));
    newnode->data=data;
    newnode->next=head;
    head=newnode;
}
void insertend(int data1)
{
    struct Node *newnode,*temp;
    newnode=(struct Node*)malloc(sizeof(struct Node));
    newnode->data=data1;
    newnode->next=NULL;
    temp=head;
    while(temp->next!=NULL)

        temp=temp->next;
        temp->next=newnode;

}