nth doubly

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

typedef struct node
{

    int a;
    char ch;
    struct node*next;
    struct node*previous;
} node;
node*head;
void display()
{

    node *list=head;
    while(list !=NULL)
    {
        printf("A: %d\n",list->a);
        printf("C: %c\n",list->ch);
        printf("\n");

        list=list->next;

    }
}
void insert_at_end(int aN,char chN)
{

    node*N=(node*)malloc(sizeof(node));
    N->a=aN;
    N->ch=chN;
    N->next=NULL;
    N->previous=NULL;
    node*list=head;
    if(head==NULL)
    {
        head=N;
    }
    else
    {
        while(list->next!=NULL)
        {
            list=list->next;
            N->previous=list;
        }
        list->next=N;
        N->next=NULL;
        N->previous=list;


    }

}
void insert_nth(int n,int aN,char chN)
{
    node *N=(node*)malloc(sizeof(node));
    N->a=aN;
    N->ch=chN;
    N->next=NULL;
    N->previous=NULL;
    if(n==1)
    {
        N->previous=NULL;
        N->next=head;
        head=N;

        return;
    }
    else
    {
        node*list=head;
        n=n-2;
        while(n!=0&&list->next!=NULL)
        {
            list=list->next;
            n--;
        }
        N->next=list->next;
        if(list->next !=NULL)
        {
            list->next->previous=N;
        }

        list->next=N;
    }
}
int main()
{
    head=NULL;
    int x,af,l;
    char cf;
    insert_at_end(1,'A');
    insert_at_end(3,'b');
    insert_at_end(5,'c');
    insert_at_end(7,'d');
    insert_at_end(9,'e');
    printf("position:");
    scanf("%d",&x);
    scanf("%d",&l);
    scanf("%d",&af);
    insert_nth(x,l,af);
    display();
}