Odd Even

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int data;
    struct node *next;
};
int main()
{
    struct node *prev,*head,*p;
    int n,i;
    printf("Input the number of nodes ");
    scanf("%d",&n);
    head=NULL;
    for(i=1;i<=n;i++)
    {
        p=(struct node*)malloc(sizeof(struct node));
        printf("Input data for node %d: ",i);
        scanf("%d",&p->data);
        p->next=NULL;
        if(head==NULL){
            head=p;
        }
        else{
            prev->next=p;
        }
        prev=p;
    }
    struct node* ptr;
    ptr=head;
    int e=0,o=0;
    while(ptr!=NULL)
    {
        if(ptr->data%2==0)  e++;
        else o++;
        ptr=ptr->next;
    }
    if(e==0)
    {
        printf("Even list is empty\n");
    }
    else
    {
        printf("Even list is :\n");
        ptr=head;
        while(ptr!=NULL)
        {
            if(ptr->data%2==0)
            {
                printf("%d ",ptr->data);
            }
            ptr=ptr->next;
        }
        printf("\n");
    }
    if(o==0)
    {
        printf("Odd list is empty\n");
    }
    else
    {
        printf("Odd list is :\n");
        ptr=head;
        while(ptr!=NULL)
        {
            if(ptr->data%2==1)
            {
                printf("%d ",ptr->data);
            }
            ptr=ptr->next;
        }
        printf("\n");
    }
    return 0;
}